Cod sursa(job #255883)
| Utilizator | Data | 10 februarie 2009 20:34:26 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N;
vector <int> V;
int main ()
{
freopen ("algsort.in","r",stdin);
freopen ("algsort.out","w",stdout);
cin>>N;
for (int i=0; i<N; ++i)
{
int x; cin>>x;
V.push_back (x);
}
sort (V.begin(), V.end());
for (int i=0; i<V.size(); ++i)
cout<<V[i]<<' ';
cout<<'\n';
return 0;
}
