Cod sursa(job #738698)
| Utilizator | Data | 21 aprilie 2012 12:21:12 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#define lmax 500050
using namespace std;
FILE *f=fopen("algsort.in","r"),*g=fopen("algsort.out","w");
int n,a[lmax];
void read()
{
fscanf(f,"%d",&n);
for(int i=1; i<=n; i++)
fscanf(f,"%d",&a[i]);
}
void show()
{
int i;
for(i=1; i<=n; i++)
fprintf(g,"%d ",a[i]);
}
int main()
{
read();
sort(a+1,a+n+1);
show();
fclose(f);
fclose(g);
return 0;
}
