Mai intai trebuie sa te autentifici.
Cod sursa(job #485587)
Utilizator | Data | 18 septembrie 2010 20:55:31 | |
---|---|---|---|
Problema | Orase | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
#include<vector>
#include<algorithm>
int maxim,ans,i,j,n,m;
using namespace std;
vector< pair<int,int> >v(50005);
int main()
{ifstream fin("orase.in");
ofstream fout("orase.out");
fin>>n>>m;
for(i=0;i<=n-1;++i)
fin>>v[i].first>>v[i].second;
sort(v.begin(),v.begin()+n);
for(i=1;i<=n;++i)
{ans=max(ans,maxim+v[i].first+v[i].second);
maxim=max(maxim,v[i].second-v[i].first);
}
fout<<ans<<'\n';
fin.close();
fout.close();
return 0;
}