Cod sursa(job #443159)
Utilizator | Avadanei Danut joRicel | Data | 16 aprilie 2010 09:38:23 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
#define MAX 500001
using namespace std;
int n,v[MAX];
void read(),out();
int main()
{
read();
sort(v,v+n);
out();
return 0;
}
void read()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(int i = 0;i < n;i++)
scanf("%d ",&v[i]);
}
void out()
{
for(int i = 0;i < n;i++)
printf("%d ",v[i]);
printf("\n");
}