Pagini recente » Cod sursa (job #3225377) | Cod sursa (job #2446165) | Cod sursa (job #197625) | Cod sursa (job #863300) | Cod sursa (job #2399835)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
vector <vector <long long int> > V;
priority_queue <long long int> pq;
long long int x,l,ans;
void citire();
int main(){
long long 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;
if(pq.size()){
ans+=pq.top();
pq.pop();
}
}
fout<<ans<<'\n';
}
void citire(){
long long 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);
}
}