Mai intai trebuie sa te autentifici.
Cod sursa(job #428299)
| Utilizator | Data | 29 martie 2010 09:27:34 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
#include<algorithm>
#define Nmax 500010
using namespace std;
int n;
long long vec[Nmax];
int compar(long long a,long long b)
{
return (a<b);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
scanf("%lld",&vec[i]);
sort(vec,vec+n,compar);
for(i=0;i<n;i++)
printf("%d ",vec[i]);
return 0;
}
