Pagini recente » Cod sursa (job #2697667) | Rating Jasper Hall (8milae6623gc9) | Cod sursa (job #237870) | Cod sursa (job #2664825) | Cod sursa (job #2399833)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
vector <vector <int> > V;
priority_queue <int> pq;
int x,l;
long long int ans;
void citire();
int main(){
int rms=0,k,i,j;
citire();
k=x%l;
while(k<=x){
for(i=rms;i<=k;i++)
for(j=0;j<V[i].size();j++)
pq.push(V[i][j]);
rms=k+1;
k+=l;
ans+=pq.top();
pq.pop();
}
fout<<ans<<'\n';
}
void citire(){
int n,i,x1,y1;
fin>>n>>x>>l;
V.resize(x+3);
for(i=1;i<=n;i++){
fin>>x1>>y1;
if(x1<=x)
V[x1].push_back(y1);
}
}