Cod sursa(job #1773787)
Utilizator | matei lascu mateil | Data | 8 octombrie 2016 11:08:33 |
---|---|---|---|
Problema | Orase | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int l[50000], d[50000];
int main()
{
ifstream f("orase.in");
ofstream g("orase.out");
int n,m,max = 0,i,j,a = 0 , b = 0;
f>>n>>m;
for(i = 0; i < n; i++){
f>>d[i]>>l[i];
if(d[i] > max)
max = d[i];
}
for(i = 0; i < n; i++){
if(d[i] + l[i] > a)
a = d[i] + l[i];
if(max - d[i] + l[i] > b)
b = max - d[i] + l[i];
}
g<<a + b - max;
return 0;
}