Pagini recente » Cod sursa (job #407247) | Cod sursa (job #2290403) | Cod sursa (job #2086139) | Cod sursa (job #2765269) | Cod sursa (job #2046874)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("heavymetal.in");
ofstream g("heavymetal.out");
struct ob{
int x,y;
}a[100001];
int n,i,v[100001];
bool comp(ob q,ob w)
{
if(q.y>w.y) return false;
if(q.y==w.y&& q.x>w.x) return false;
return true;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i].x>>a[i].y;
sort(a+1,a+n+1,comp);
int o=1;
for(i=1;i<=a[n].y;i++)
{
v[i]=v[i-1];
while(i==a[o].y)
{
int m=a[o].y-a[o].x+v[a[o].x];
v[i]=max(v[i],m);
o++;
}
}
g<<v[a[n].y];
return 0;
}