Pagini recente » Cod sursa (job #570057) | Cod sursa (job #2308371) | Cod sursa (job #2894843) | Istoria paginii runda/ichb_11-12/clasament | Cod sursa (job #2286959)
#pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define PII pair < int , int >
#define MOD 1000000007
using namespace std;
int n, m, l;
struct my {
int pos, val, en;
};
my a[100100];
ll rs;
multiset < ll > S;
set < int > SS;
unordered_map < int , vector < int > > M;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ifstream cin("lupu.in");
ofstream cout("lupu.out");
cin >> n >> m >> l;
int r = (m + 1) % l;
for (int i = 1; i <= n; i++) {
cin >> a[i].pos >> a[i].val;
if (a[i].pos < r) S.insert(a[i].val);
else {
SS.insert((a[i].pos - r) / l);
M[(a[i].pos - r) / l].push_back(a[i].val);
}
}
if (S.size()) rs += *S.rbegin(), S.erase(S.find(*S.rbegin()));
for (auto it : SS) {
for (auto it2: M[it]) {
S.insert(it2);
}
if (S.size()) rs += *S.rbegin(), S.erase(S.find(*S.rbegin()));
}
cout << rs;
return 0;
}