Cod sursa(job #1816719)
Utilizator | Data | 26 noiembrie 2016 20:04:22 | |
---|---|---|---|
Problema | Orase | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("orase.in");
ofstream fout("orase.out");
long long n, m, i, j, maxim1, maxim2=-2000000000;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++){
fin>>m>>j;
if(m+j>maxim1)
maxim1=m+j;
if(j-m>maxim2)
maxim2=j-m;
}
fout<<maxim1+maxim2;
return 0;
}