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
#include<iostream>
#include<cstdio>
using namespace std;

long long tab[500001];
int xD[500001];

int main(){
    int n, m;
    int tmp1, tmp2;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        scanf("%d",&xD[i]);
    }
    int prev=0;
    long long suma=0;
    for(int i=0;i<m;i++){
        scanf("%d%d",&tmp1,&tmp2);
        for(int j=0;j<n;j++){
            tab[j]+=(tmp1-prev)*xD[j];
            suma+=max(tab[j],(long long)tmp2)-tmp2;
            tab[j]=min((long long)tmp2,tab[j]);
        }
        prev=tmp1;
        printf("%lld\n",suma);
        suma=0;
    }
}