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
#include <iostream>

using namespace std;

int main()
{
    int n, m, waga=0;
    cin>>n>>m;

    int a[n], dl[n], b[m], d[m];

    for (int i=0; i<n; i++)
    {
        cin>>a[i];
        dl[i]=a[i];
    }
    for (int i=0; i<m; i++)
        cin>>d[i]>>b[i];

    for (int i=0; i<m; i++)
    {
        for (int j=0; j<n; j++)
        {
            if (dl[j]>=b[i])
            {
                waga+=dl[j]-b[i];
                dl[j]=b[i]+a[j];
            }
            else
                dl[j]+=a[j];
        }
        cout<<waga<<endl;
        waga=0;
    }
}