Pagini recente » Cod sursa (job #687328) | Cod sursa (job #2099552) | Cod sursa (job #748077) | Cod sursa (job #778080) | Cod sursa (job #1773787)
#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;
}