Pagini recente » Cod sursa (job #2197411) | Cod sursa (job #2278227) | Cod sursa (job #242688) | Cod sursa (job #69776) | Cod sursa (job #68474)
Cod sursa(job #68474)
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define nmax 50000
FILE *in = fopen("orase.in","r"), *out = fopen("orase.out","w");
struct orase
{
int d, l;
};
int m, n;
orase a[nmax];
int rez;
void read()
{
fscanf(in, "%d %d", &m, &n);
for ( int i = 0; i < n; ++i )
fscanf(in, "%d %d", &a[i].d, &a[i].l);
}
bool operator<(const orase &x, const orase &y)
{
return x.d + x.l < y.d + y.l;
}
int main()
{
read();
std::sort(a, a+n);
for ( int i = 1; i < n; ++i )
if ( a[i].l + a[i-1].l + abs(a[i-1].d-a[i].d) > rez )
rez = a[i].l + a[i-1].l + abs(a[i-1].d-a[i].d);
fprintf(out, "%d\n", rez);
return 0;
}