Pagini recente » Cod sursa (job #313536) | Cod sursa (job #708199) | Cod sursa (job #1409452) | Cod sursa (job #2918765) | Cod sursa (job #805993)
Cod sursa(job #805993)
#include <fstream>
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
int n,m;
struct orase{
int D;
int L;
};
orase o[50001];
int cmp(orase a,orase b){
if(a.D>b.D)
return 0;
else{
if(a.L>b.L)
return 0;
}
return 1;
}
int main(void){
register int i,j;
f>>m>>n;
for(i=1;i<=n;i++)
f>>o[i].D>>o[i].L;
sort(o+1,O+n+1,cmp);
int d=o[1].L;
int sol=0;
for(i=2;i<=n;i++){
d+=o[i].D-o[i-1].D;
if(d+o[i].L>sol)
sol=dmax+o[i].L;
if(o[i].L>d)
d=o[i].L;
}
g<<sol;
f.close();
g.close();
return 0;
}