Cod sursa(job #1813222)
Utilizator | Data | 22 noiembrie 2016 20:08:41 | |
---|---|---|---|
Problema | Lupul Urias si Rau | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");
int n,i,dmax,l,st[100002],d,sol,ns;
pair<int ,int> a[100002];
int main()
{
fin >> n >> dmax >> l;
for (i=1;i<=n;i++)
{
fin >> a[i].first >> a[i].second;
}
sort (a+1,a+n+1);
for (d=0;d<=dmax;d+=l)
{
for (i=n;i>=1 && a[i].first<=dmax-d;i--)
{
ns++;
st[ns]=a[i].second;
}
if (ns!=0)
{
sol=sol+st[ns];
ns--;
}
}
fout << sol+l;
return 0;
}