Cod sursa(job #2148437)
| Utilizator | Data | 1 martie 2018 18:37:32 | |
|---|---|---|---|
| Problema | Orase | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
#define pii pair<int,int>
#define Nmax 50005
using namespace std;
ifstream in("orase.in");
ofstream out("orase.out");
pii v[Nmax];
int main()
{
int n,m,i,maxx=-1,maxx1=-1;
in>>n>>m;
for (i=1;i<=m;i++)
{
in>>v[i].first>>v[i].second;
}
sort(v+1,v+n+1);
maxx=v[n].first+v[n].second;
for (i=1;i<=n;i++)
{
maxx1=max(maxx1,maxx-v[i].first+v[i].second);
maxx=max(maxx,v[i].first+v[i].second);
}
out<<maxx1;
return 0;
}
