Pagini recente » Cod sursa (job #2091712) | Cod sursa (job #2365713) | Cod sursa (job #3130349) | Cod sursa (job #1128404) | Cod sursa (job #881087)
Cod sursa(job #881087)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
const int Nmax = 100009;
int N; int X; int L;
vector<int> V[Nmax];
void Read() {
fin >>N >> X >> L;
for(int i = 1; i <= N; ++i){
int x, y; fin >>x >> y;
V[(X - x) / L + 1].push_back(y);
}
}
void Solve(){
int MaxL , MaxS = 0;
for(int i = 1; i < Nmax; ++i){
MaxL = 0;
for(int j = 0 ;j < V[i].size(); ++j){
if(V[i][j] > MaxL)
MaxL = V[i][j];
}
MaxS += MaxL;
}
fout << MaxS <<'\n';
}
int main(){
Read ();
Solve ();
return 0;
}