Pagini recente » Borderou de evaluare (job #2188619) | Cod sursa (job #3238067) | Cod sursa (job #765986) | Cod sursa (job #3235530) | Cod sursa (job #563297)
Cod sursa(job #563297)
#include<cstdio>
#include<algorithm>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
long n,v[500000];
int main()
{ fscanf(f,"%ld",&n);
long i;
for (i=1;i<=n;i++)
fscanf(f,"%ld",&v[i]);
sort(v+1,v+n+1);
for (i=1;i<=n;i++)
fprintf(g,"%ld ",v[i]);
fclose(f);
fclose(g);
return 0;
}