Cod sursa(job #2561889)
Utilizator | Dumitru Daniel Danut200333 | Data | 29 februarie 2020 10:58:41 |
---|---|---|---|
Problema | Heavy metal | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("heavymetal.in");
ofstream fout("heavymetal.out");
struct kys{int x,y;}a[100001];
int compare (kys a,kys b)
{
return a.y<b.y||a.y==b.y&&a.x>b.x;
}
int n,i,max1,v[100001],j,st,dr,mid;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i].x>>a[i].y;
}
sort(a+1,a+n+1,compare);
i=1;
for(j=1;j<=a[n].y;j++)
{
v[j]=v[j-1];
while(a[i].y==j)
{
v[j]=max(v[j],v[a[i].x]+a[i].y-a[i].x);
i++;
}
}
fout<<v[a[n].y];
return 0;
}