BC 34# 1001 Go to movies

這是一個建立於 的文章，其中的資訊可能已經有所發展或是發生改變。

簡單的類比

#include<stdio.h>#include<algorithm>#include<iostream>using namespace std;int a[105], b[105], f[105];bool cmp(int a, int b){return a < b;}int main(){//freopen("E:\input.txt", "r", stdin);int m, n;int i, flag;int res;while ((scanf("%d%d", &n, &m)) != EOF){flag = 1;res = f[0];if (n == 1){flag = 0;}for (i = 1; i <= m; i++){scanf("%d%d", &a[i], &b[i]);if (n % a[i] > 0 && flag){f[i] = (n / a[i] + 1) * b[i];}else if (flag){f[i] = n / a[i] * b[i];}}if (!flag){for (i = 1; i <= m; i++){f[i] = b[i];}}sort (f + 1, f + 1 + m, cmp);res = f[1];printf("%d\n", res);}return 0;}