Pagini recente » Sandbox (cutiuţa cu năsip) | Cod sursa (job #415702) | Cod sursa (job #883084) | Cod sursa (job #1598054) | Cod sursa (job #2251876)
#include <bits/stdc++.h>
#define Dim 50004
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
long N,M;
long ans;
pair < long,long> V[Dim];
int main()
{
f>>M>>N;
for(int i=1;i<=N;i++)
f>>V[i].first>>V[i].second;
sort(V+1,V+N+1);
for(int i=1;i<=N;i++)
for(int j=i-1;j>=1;j--)
ans=max(ans,V[i].second+V[j].second+V[i].first-V[i].second);
g<<ans;
return 0;
}