Cod sursa(job #410278)
Utilizator | Data | 4 martie 2010 11:16:25 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f=fopen("algsort.in", "r"), *g=fopen("algsort.out", "w");
long long v[500005], i, n;
int main(void)
{
fscanf(f, "%lld", &n);
for (i=1;i<=n;i++)
fscanf(f, "%lld", &v[i]);
sort(v + 1, v + n + 1);
for (i=1;i<=n;i++)
fprintf(g, "%lld ", v[i]);
return 0;
}