Pagini recente » Cod sursa (job #927869) | Cod sursa (job #1216203) | Cod sursa (job #1073601) | Cod sursa (job #2731088) | Cod sursa (job #1692570)
#include <bits/stdc++.h>
#define ll long long
#define MOD 666013
using namespace std;
int N, M;
struct drum{
int p, l;
};
drum A[50006];
bool comp(drum a, drum b){
return a.l > b.l;
}
bool comps(drum a, drum b){
return a.p < b.l;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ifstream cin("orase.in");
ofstream cout("orase.out");
cin >> M >> N;
for(int i = 1; i <= N; i++)
cin >> A[i].p >> A[i].l;
sort(A+1, A+N+1, comp);
int rs1 = (abs(A[1].p - A[2].p) + A[1].l + A[2].l);
sort(A+1, A+N+1, comps);
int rs2 = A[N].p-A[1].p + A[1].l + A[N].l;
cout << max(rs1,rs2);
return 0;
}