#include<iostream> using namespace std; int main() { long long int n, m, masa, b, d, ostd; long long n1; long long wsk; wsk=1; ostd = 0; cin >> n >> m; n1 = n; long long int t[n+1]; long long int h[n+1]; for (long long int l=0; l<n+1; l++) { h[l] = 0; } for (;n>0;) { cin >> t[wsk]; n--; wsk++; } n=n1; wsk=1; for(;;) { masa=0; if(m>0) { cin >> d >> b; for(;n>0;) { h[wsk] = h[wsk]+((d-ostd)*t[wsk]); wsk++; n--; } } n=n1; wsk=1; for(;n>0;) { if(h[wsk]>b) { masa = masa + h[wsk] - b; h[wsk] = b; n--; wsk++; } else { n--; wsk++; } } if(m==1) { cout << masa; return 0; } else { cout << masa << endl; } ostd=d; n=n1; m--; wsk=1; } }
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 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 | #include<iostream> using namespace std; int main() { long long int n, m, masa, b, d, ostd; long long n1; long long wsk; wsk=1; ostd = 0; cin >> n >> m; n1 = n; long long int t[n+1]; long long int h[n+1]; for (long long int l=0; l<n+1; l++) { h[l] = 0; } for (;n>0;) { cin >> t[wsk]; n--; wsk++; } n=n1; wsk=1; for(;;) { masa=0; if(m>0) { cin >> d >> b; for(;n>0;) { h[wsk] = h[wsk]+((d-ostd)*t[wsk]); wsk++; n--; } } n=n1; wsk=1; for(;n>0;) { if(h[wsk]>b) { masa = masa + h[wsk] - b; h[wsk] = b; n--; wsk++; } else { n--; wsk++; } } if(m==1) { cout << masa; return 0; } else { cout << masa << endl; } ostd=d; n=n1; m--; wsk=1; } } |