Pagini recente » Istoria paginii utilizator/mark1q | Cod sursa (job #3362692) | Istoria paginii utilizator/sam95 | Monitorul de evaluare | Cod sursa (job #3362570)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
int n, x, l, blanaa=0;
struct oaie {
int dist, blana;
bool operator<(const oaie &o) const {
return blana < o.blana;
}
};
oaie v[100000];
priority_queue<oaie> pq;
signed main() {
fin>>n>>x>>l;
for (int i=0;i<n;++i) {
fin>>v[i].dist>>v[i].blana;
pq.push(v[i]);
//cout<< pq.top().blana<<endl;
}
int ll=0;
for (int i=0;i<n;++i) {
if (pq.top().dist+ll<=x) {
blanaa+=pq.top().blana;
ll+=l;
}
pq.pop();
}
fout<<blanaa;
return 0;
}