Pagini recente » Cod sursa (job #959323) | Cod sursa (job #913573) | Cod sursa (job #2426790) | Cod sursa (job #1376613) | Cod sursa (job #2671386)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("orase.in");
ofstream out("orase.out");
int v[100001],l[100001],n,sc=0,lstrp,smax=0,i,j;
in>>lstrp>>n;
for(i=1;i<=n;i++)
{
in>>v[i]>>l[i];
}
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(v[i]>v[j])
{
sc=l[i]+l[j]+(v[i]-v[j]);
}
else
{
sc=l[i]+l[j]+(v[j]-v[i]);
}
if(sc>smax)
{
smax=sc;
}
sc=0;
}
}
out<<smax;
return 0;
}