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