Cod sursa(job #683333)
| Utilizator | Data | 20 februarie 2012 15:09:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int i, x, N;
freopen( "algsort.in", "r", stdin );
freopen( "algsort.out", "w", stdout );
scanf( "%d", &N );
vector<int>V;
vector<int>::iterator it;
for( i = 0; i < N; i++ )
scanf( "%d", &x ), V.push_back( x );
sort(V.begin(),V.end());
for(it=V.begin(); it!=V.end(); ++it )
printf( "%d ", *it );
return 0;
}
