Cod sursa(job #1768966)
| Utilizator | Data | 1 octombrie 2016 19:18:58 | |
|---|---|---|---|
| Problema | Orase | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
#include<algorithm>
#include<iostream>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
int m,n,i,maxi,j;
pair<int, int> v[50001];
int main()
{
fin>>m>>n;
for(i=1;i<=n;i++)
fin>>v[i].first>>v[i].second;
sort(v+1,v+n+1);
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
maxi=max(maxi, v[j].first-v[i].first+v[j].second+v[i].second);
}
fout<<maxi;
fin.close();
fout.close();
return 0;
}
