Pagini recente » Cod sursa (job #68878) | Cod sursa (job #1399325) | Cod sursa (job #1989199) | Cod sursa (job #2061965) | Cod sursa (job #2506760)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("lupu.in");
ofstream fout("lupu.out");
int n,k,l,i,oaie,sol;
pair<int,int> v[100010];
int main(){
fin>>n>>k>>l;
for(i=1;i<=n;i++)
fin>>v[i].second>>v[i].first;
sort(v+1,v+n+1);
oaie=n;
while(oaie && k>=0){
while(v[oaie].second > k)
oaie--;
if(oaie){
sol+=v[oaie].first;
k-=l;
oaie--;
}
}
fout<<sol;
return 0;
}