Pagini recente » Istoria paginii runda/oni2006runda2 | Cod sursa (job #2806250) | Cod sursa (job #2442729) | Cod sursa (job #596149) | Cod sursa (job #2403824)
//#include <iostream>
#include <fstream>
//#include <string.h>
using namespace std;
ifstream cin("orase.in");
ofstream cout("orase.out");
struct ana{int a, b;};
void fun(int x,ana v[],int n,int &max)
{int aux;
for(int i=x+1;i<=n;i++)
{
if(v[x].a-v[i].a>0)
aux=v[x].a-v[i].a;
else
aux=v[i].a-v[x].a;
if(aux+v[x].b+v[i].b>max)
max=aux+v[x].b+v[i].b;
}
}
int main()
{
int m,n,max=0;
cin>>m>>n;
ana v[n+1];
for(int i=1;i<=n;i++)
cin>>v[i].a>>v[i].b;
for(int i=1;i<n;i++)
fun(i,v,n,max);
cout<<max;
}