Cod sursa(job #1822985)
Utilizator | Data | 5 decembrie 2016 19:39:29 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
#define NX 500010
using namespace std;
int N, A[NX], B[NX];
int main() {
int i;
freopen( "algsort.in", "r", stdin );
freopen( "algsort.out", "w", stdout );
scanf( "%d", &N );
for( i = 1; i <= N; i++ )
scanf( "%d", &A[i] );
sort(A + 1, A + N + 1);
for( i = 1; i <= N; i++ )
printf( "%d ", A[i] );
return 0;
}