Cod sursa(job #246185)
| Utilizator | Data | 20 ianuarie 2009 11:23:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <algorithm>
#include <stdio.h>
#define IN "algsort.in"
#define OUT "algsort.out"
#define max 500005
using namespace std;
FILE *fin=fopen(IN,"r");
FILE *fout=fopen(OUT,"w");
long a[max],n;
int main()
{
long i;
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++)
fscanf(fin,"%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<=n;i++)
fprintf(fout,"%d ",a[i]);
return 0;
}
