Cod sursa(job #1117502)
Utilizator | Data | 23 februarie 2014 16:42:04 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
using namespace std; /* qsort */
unsigned int v[500001],n;
int main ()
{
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;++i)fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
for (int i=1; i<=n; ++i)
fprintf (g,"%d ",v[i]);
return 0;
}