Cod sursa(job #349786)
| Utilizator | Data | 21 septembrie 2009 15:39:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
#include<iostream.h>
#include<stdlib.h>
using namespace std;
struct asd{ int x;};
asd v[500002];
int cmp(const void *a, const void *b)
{return ((asd *)a)->x-((asd *)b)->x;}
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int i,n,x;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i].x;
qsort(v, n+1,sizeof(asd), cmp);
for(i=1;i<=n;i++)
cout<<v[i].x<<' ';
cout<<'\n';
return 0;
}