Pagini recente » Cod sursa (job #565113) | Cod sursa (job #748295) | Cod sursa (job #3281960) | Cod sursa (job #765294) | Cod sursa (job #1051494)
#include<cstdio>
#include<vector>
#include<set>
using namespace std;
vector <int> v[100003];
multiset<int> h;
long long n,k,l,i,mx,d,PUF,s;
int main()
{
freopen("lupu.in","r",stdin);
freopen("lupu.out","w",stdout);
scanf("%d%d%d",&n,&k,&l);
mx=0;
s=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&d,&PUF);
v[((k-d)/l)+1].push_back(PUF);
if((k-d)/l>=mx)
{
mx=(k-d)/l;
mx++;
}
}
vector<int> ::iterator it;
multiset<int> ::iterator it2;
for(i=mx;i>=1;i--)
{
for(it=v[i].begin();it!=v[i].end();it++)
{
h.insert((*it));
}
it2=h.end();
it2--;
s+=*it2;
h.erase(it2);
}
printf("%d\n",s);
}