Cod sursa(job #295196)
| Utilizator | Data | 3 aprilie 2009 08:02:44 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#include<algorithm>
int n,i,v[500001];
using namespace std;
int main(){
FILE*f=fopen("algsort.in","r");
FILE*g=fopen("algsort.out","w");
fscanf(f,"%d\n",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
fprintf(g,"%d ",v[i]);
fclose(f);
fclose(g);
return 0;
}
