Pagini recente » Cod sursa (job #1019552) | Cod sursa (job #1607804) | Cod sursa (job #1848169) | Cod sursa (job #2524950) | Cod sursa (job #530061)
Cod sursa(job #530061)
#include<fstream>
#include<iomanip>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
struct distanta{
int d, l;
};
distanta a[50002];
int m, n;
void Read();
void Solve();
int main()
{
Read();
Solve();
fin.close();
fout.close();
return 0;
}
bool sortat( distanta x, distanta y )
{
return x.d < y.d;
}
void Read()
{
fin >> m >> n;
for( int i = 1; i <= n; ++i )
fin >> a[i].d >> a[i].l;
}
void Solve()
{
int max_drum = -999;
sort( a+1, a+n+1, sortat );
int x = 1;
for( int i = 2; i <= n; ++i )
if( a[i].d - a[x].d + a[x].l + a[i].l > max_drum )
{
max_drum = a[i].d - a[x].d + a[x].l + a[i].l;
x = i;
}
fout << max_drum <<'\n';
}