#pragma GCC optimize ("Ofast") #include using namespace std; void *wmem; char memarr[96000000]; template inline void walloc1d(T **arr, int x, void **mem = &wmem){ static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] ); (*arr)=(T*)(*mem); (*mem)=((*arr)+x); } template void sortA_L(int N, T1 a[], void *mem = wmem){ sort(a, a+N); } template void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){ int i; pair *arr; walloc1d(&arr, N, &mem); for(i=(0);i<(N);i++){ arr[i].first = a[i]; arr[i].second = b[i]; } sort(arr, arr+N); for(i=(0);i<(N);i++){ a[i] = arr[i].first; b[i] = arr[i].second; } } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } inline void rd(long long &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(long long x){ int s=0; int m=0; char f[20]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } int N; int Q; long long X[100000]; long long W[100000]; long long P[100000]; int ind[100000]; long long res[100000]; int main(){ int i; wmem = memarr; int k = 0; long long lef = 0; long long rig = 0; long long now = 0; long long tmp = 0; rd(N); rd(Q); { int Lj4PdHRW; for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){ rd(X[Lj4PdHRW]); rd(W[Lj4PdHRW]); } } { int e98WHCEY; for(e98WHCEY=(0);e98WHCEY<(Q);e98WHCEY++){ rd(P[e98WHCEY]); } } for(i=(0);i<(Q);i++){ ind[i] = i; } sortA_L(N,X,W); sortA_L(Q,P,ind); for(i=(0);i<(N);i++){ tmp += X[i] * W[i]; rig += W[i]; } for(i=(0);i<(Q);i++){ while(k < N && X[k] < P[i]){ tmp += (X[k] - now) * (lef - rig); now = X[k]; rig -= W[k]; lef += W[k]; k++; } tmp += (P[i] - now) * (lef - rig); now = P[i]; res[ind[i]] = tmp; } { int hCmBdyQB; for(hCmBdyQB=(0);hCmBdyQB<(Q);hCmBdyQB++){ wt_L(res[hCmBdyQB]); wt_L('\n'); } } return 0; } // cLay varsion 20200317-1 // --- original code --- // int N, Q; // ll X[1d5], W[1d5], P[1d5]; int ind[1d5]; // ll res[1d5]; // // { // int k = 0; // ll lef = 0, rig = 0, now = 0, tmp = 0; // rd(N,Q,(X,W)(N),P(Q)); // rep(i,Q) ind[i] = i; // sortA(N,X,W); // sortA(Q,P,ind); // // rep(i,N){ // tmp += X[i] * W[i]; // rig += W[i]; // } // // rep(i,Q){ // while(k < N && X[k] < P[i]){ // tmp += (X[k] - now) * (lef - rig); // now = X[k]; // rig -= W[k]; // lef += W[k]; // k++; // } // tmp += (P[i] - now) * (lef - rig); // now = P[i]; // res[ind[i]] = tmp; // } // wtLn(res(Q)); // }