Pagini recente » Cod sursa (job #103227) | Cod sursa (job #2388770) | Cod sursa (job #801143) | Cod sursa (job #370597) | Cod sursa (job #60814)
Cod sursa(job #60814)
#include<stdio.h>
#include<stdlib.h>
struct oi{
int d,a,t;
};
int comp(const void*p,const void*q){
oi *pp=(oi*)p,*qq=(oi*)q;
oi px=*pp, py=*qq;
if(px.t>py.t)
return 1;
if(px.t<py.t)
return -1;
return 0;
}
oi nr[100001];
int main(){
freopen("lupu.in","r",stdin);
freopen("lupu.out","w",stdout);
int n,x,l,i,max,t;
long long s;
scanf("%d %d %d",&n,&x,&l);
for(i=0;i<n;i++){
scanf("%d %d",&nr[i].d,&nr[i].a);
nr[i].t=(x-nr[i].d)/l;
}
qsort(nr,n,sizeof(nr[0]),comp);
for(i=0;nr[i].t<0;i++)
;
s=0;
t=0;
while(i<n){
max=0;
while(nr[i].t==t){
if(nr[i].a>max)
max=nr[i].a;
i++;
}
s=s+max;
t++;
}
printf("%lld\n",s);
return 0;
}