Pagini recente » bac-calinush | Cod sursa (job #1141256) | Cod sursa (job #2916871) | Algoritmiada 2013 - Clasament Runda 4, Clasele 5-9 | Cod sursa (job #200948)
Cod sursa(job #200948)
#include <stdio.h>
#define NMAX 50000
unsigned int n,m,i,j,aux,maxim,q;
unsigned int D[NMAX],L[NMAX];
int main()
{
freopen("orase.in","rt",stdin);
freopen("orase.out","wt",stdout);
scanf("%u %u", &m, &n);
for (i=1;i<=n;i++)
scanf("%u %u", &D[i], &L[i]);
for (i=1;i<=n-1;++i)
for (j=i+1;j<=n;++j)
if (D[i]>D[j])
{
aux=D[i];
D[i]=D[j];
D[j]=aux;
}
maxim=0;
j=1;
while (j<=n)
{
i=j+1;
while (i<=n)
{
q=D[i]+L[i]+L[j]-D[j];
if (maxim<q)
maxim=q;
++i;
}
++j;
}
printf("%u",maxim);
return 0;
}