Cod sursa(job #959634)
Utilizator | Data | 8 iunie 2013 14:17:09 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
long int n,i,v[500001];
FILE *f,*g;
int main(){
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%ld",&n);
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;}