Cod sursa(job #904335)
Utilizator | Data | 4 martie 2013 09:46:15 | |
---|---|---|---|
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;
FILE *f,*s;
int n,i,v[500005];
int main()
{
f=fopen("algsort.in","r");
s=fopen("algsort.out","w");
fscanf(f,"%d",&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(s,"%d ",v[i]);
fclose(s);
return 0;
}