#include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, m, p; cin >> n >> m; vector<int> sz_wzrostu(n); vector<long long int> skoszone; skoszone.resize(n, 0); for (int i = 0; i < n; i++) { cin >> p; sz_wzrostu[i] = p; } long long int d, b, pom; long long int suma; for (int i = 0; i < m; i++) { cin >> d >> b; suma = 0; for (int j = 0; j < n; j++) { pom = ((sz_wzrostu[j] * d) - skoszone[j]) - b; if (pom > 0) { suma += pom; skoszone[j] += pom; } } cout << suma << endl; } 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 33 34 35 36 37 38 39 40 41 42 43 44 | #include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, m, p; cin >> n >> m; vector<int> sz_wzrostu(n); vector<long long int> skoszone; skoszone.resize(n, 0); for (int i = 0; i < n; i++) { cin >> p; sz_wzrostu[i] = p; } long long int d, b, pom; long long int suma; for (int i = 0; i < m; i++) { cin >> d >> b; suma = 0; for (int j = 0; j < n; j++) { pom = ((sz_wzrostu[j] * d) - skoszone[j]) - b; if (pom > 0) { suma += pom; skoszone[j] += pom; } } cout << suma << endl; } return 0; } |