Pagini recente » Cod sursa (job #397852) | Cod sursa (job #2713630) | Cod sursa (job #2257527) | Cod sursa (job #1893568) | Cod sursa (job #531757)
Cod sursa(job #531757)
#include <fstream.h>
int N ,M ,i , D[1000000] , L[1000000] , aux , V[1000000] , ok , max , j;
int main()
{
ifstream f("orase.in");
ofstream g("orase.out");
f>>N>>M;
for(i=1;i<=N;i++){
f>>D[i];
f>>L[i];
}
for(i=1;i<=N;i++){
for(j=i;j<=N;j++){
if(D[i]>D[j]){
aux=D[i];
D[i]=D[j];
D[j]=aux;
aux=L[i];
L[i]=L[j];
L[j]=aux;
}
}
}
V[1]=D[1];
for(i=2;i<=N;i++){
ok=0;
if(V[i-1]+D[i]-D[i-1]>=D[i]-D[i-1]+L[i-1]){
V[i]=V[i-1]+D[i]-D[i-1];
}
else{
V[i]=D[i]-D[i-1]+L[i-1];
ok=1;
}
if(V[i]+L[i]>max&&ok==1){
max=V[i];
}
}
g<<max;
f.close();
g.close();
return 0;
}