Pagini recente » Cod sursa (job #2649139) | Cod sursa (job #1389650) | Cod sursa (job #2960506) | Cod sursa (job #2727869) | Cod sursa (job #2497977)
#include <iostream>
#include <fstream>
#include <algorithm>
#define Nmax 100001
using namespace std;
ifstream f("heavymetal.in");
ofstream o("heavymetal.out");
struct form{
int a,b;
}fo[Nmax];
bool cmp(form &f1,form &f2){
return f1.b < f2.b;
}
int i,j,n,dp[Nmax],t;
int main()
{
f >> n;
for(i=1;i<=n;++i)
f >> fo[i].a >> fo[i].b;
sort(fo+1,fo+n+1,cmp);
dp[1]=fo[1].b-fo[1].a;
for(i=2;i<=n;++i){
t=fo[i].b-fo[i].a;
dp[i]=dp[i-1];
for(j=i-1;j>0 && fo[j].b>fo[i].a;--j);
dp[i]=max(dp[i],dp[j]+t);
}
o << dp[n];
return 0;
}