Cod sursa(job #1723499)
Utilizator | Data | 30 iunie 2016 19:55:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdio>
#include <algorithm>
#define MAXN 500000
int v[MAXN+1];
int main(){
FILE*fi,*fout;
int i,n;
fi=fopen("algsort.in" ,"r");
fout=fopen("algsort.out" ,"w");
fscanf(fi,"%d" ,&n);
for(i=1;i<=n;i++)
fscanf(fi,"%d" ,&v[i]);
std::sort(v+1,v+n+1);
for(i=1;i<=n;i++)
fprintf(fout,"%d " ,v[i]);
fclose(fi);
fclose(fout);
return 0;
}