Pagini recente » Borderou de evaluare (job #1568317) | Borderou de evaluare (job #2868444) | Borderou de evaluare (job #1589390) | Cod sursa (job #575232) | Cod sursa (job #2018203)
#include<cstdio>
#include<algorithm>
#define MAX_N 500000
using namespace std;
int v[MAX_N], n;
int main()
{
int i;
FILE *fin, *fout;
fin = fopen("algsort.in","r");
fout = fopen("algsort.out","w");
fscanf(fin,"%d",&n);
for(i=0; i<n; i++)
fscanf(fin,"%d",&v[i]);
sort(v,v+n);
for(i=0; i<n; i++)
fprintf(fout,"%d ",v[i]);
fprintf(fout,"\n");
fclose(fin);
fclose(fout);
return 0;
}