Codeforces Round #321 (Div. 2) b. Kefa and Company

After sorting o (n) enumerates the tails. The head is monotonous, maintenance is good.

#include <bits/stdc++.h>using namespaceStd;typedefLong Longll;//#define LOCALConst intMAXN = 1e5+5;structnode{intm,s; voidIn () {scanf ("%d%d",&m,&s); }    BOOL operator< (ConstNODE&AMP;RH)Const {        returnM <RH.M; }}nd[maxn];ll SS[MAXN];intMain () {#ifdef LOCAL freopen ("In.txt","R", stdin);#endif    intN,d; scanf"%d%d",&n,&d);  for(inti =1; I <= N; i++) {Nd[i].    In (); } sort (nd+1, nd+1+N);  for(inti =1; I <= N; i++) {Ss[i]= ss[i-1]+Nd[i].s; } ll ans=0;  for(inti =1, j =1; I <= N; i++){         while(J<n && nd[j+1].M-ND[I].M < D) J + +; Ans= Max (ans,ss[j]-ss[i-1]); } printf ("%i64d", ans); return 0;}

Codeforces Round #321 (Div. 2) b. Kefa and Company