Cod sursa(job #2708429)
| Utilizator | Data | 18 februarie 2021 18:39:04 | |
|---|---|---|---|
| Problema | Lupul Urias si Rau | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <map>
using namespace std;
int const N = 1e5 + 3;
ifstream f ("lupu.in");
ofstream g ("lupu.out");
int ind [N];
map <int , int> v;
int main()
{
int n , x , D , r = 0;
f >> n >> x >> D;
for(int i = 1 ; i <= n ; ++ i){
int a , b;
f >> a >> b;
v [a / D] = max (v [a / D] , b);
}
for(auto [x , y] : v)
r += y;
g << r;
return 0;
}
