Pagini recente » Cod sursa (job #2557990) | Cod sursa (job #2331163) | Cod sursa (job #1613566) | Cod sursa (job #2350596) | Cod sursa (job #2097200)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("heavymetal.in");
ofstream g("heavymetal.out");
struct heavymetal{
int a,b;
}v[100001];
int cmp(heavymetal x,heavymetal y)
{
if(x.a<y.a)
return 1;
if(x.a==y.a)
return x.b<y.b;
return 0;
}
int n,i,j,d[100001],Max;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i].a>>v[i].b;
sort(v+1,v+n+1,cmp);
for(i=1;i<=n;i++)
{
for(j=i-1;j>=0;j--)
if(v[j].b<=v[i].a)
d[i]=max(d[i],d[j]+v[i].b-v[i].a);
Max=max(Max,d[i]);
}
g<<Max;
return 0;
}