Cod sursa(job #357496)
| Utilizator | Data | 19 octombrie 2009 16:34:29 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
//Problema: http://infoarena.ro/problema/algsort
#include <stdio.h>
#include <algorithm>
using namespace std;
long N;
long Sir[500001];
bool cmp(long A, long B)
{
return (A<B);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%ld",&N);
for(int i=0;i<N;i++)
{
scanf("%ld",&Sir[i]);
}
sort(Sir, Sir+N-1, cmp);
for(int i=0;i<N;i++)
{
printf("%ld ",Sir[i]);
}
return 0;
}
