Cod sursa(job #871800)
| Utilizator | Data | 5 februarie 2013 11:48:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
#include<stdlib.h>
#define Nmax 500002
using namespace std;
int n,a[Nmax];
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
void rezolv()
{
int i;
scanf("%d",&n);
for(i=0;i<n;++i)
scanf("%d",&a[i]);
qsort(a,n,sizeof(int),compare);
for(i=0;i<n;++i)
printf("%d ",a[i]);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
rezolv();
fclose(stdin);
fclose(stdout);
return 0;
}
