#include <cstdio> #include <cstring> using namespace std; int main() { int n, m; scanf("%d%d", &n, &m); long long grow[n]; for (int i = 0; i < n; i++) scanf("%lld", grow + i); long long cutted[n]; memset(cutted, 0, sizeof(cutted)); for (int i = 0; i < m; i++) { long long sum = 0; long long day, cut; scanf("%lld%lld", &day, &cut); for (int j = 0; j < n; j++) { long long int hi = grow[j] * day - cutted[j]; if (hi > cut) { sum += hi - cut; cutted[j] += hi - cut; } } printf("%lld\n", sum); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 | #include <cstdio> #include <cstring> using namespace std; int main() { int n, m; scanf("%d%d", &n, &m); long long grow[n]; for (int i = 0; i < n; i++) scanf("%lld", grow + i); long long cutted[n]; memset(cutted, 0, sizeof(cutted)); for (int i = 0; i < m; i++) { long long sum = 0; long long day, cut; scanf("%lld%lld", &day, &cut); for (int j = 0; j < n; j++) { long long int hi = grow[j] * day - cutted[j]; if (hi > cut) { sum += hi - cut; cutted[j] += hi - cut; } } printf("%lld\n", sum); } return 0; } |