Cod sursa(job #604578)
Utilizator | Heidelbacher Andrei a_h1926 | Data | 23 iulie 2011 15:31:26 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <algorithm>
#define NMax 500005
using namespace std;
int N, X[NMax];
int main()
{
freopen ("algsort.in", "r", stdin);
freopen ("algsort.out", "w", stdout);
scanf ("%d", &N);
for (int i=1; i<=N; ++i)
{
scanf ("%d", &X[i]);
}
sort (X+1, X+N+1);
for (int i=1; i<=N; ++i)
{
printf ("%d ", X[i]);
}
printf ("\n");
return 0;
}