Cod sursa(job #726817)
Utilizator | Radu Tatomir morlock | Data | 27 martie 2012 15:40:47 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 500005
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
vector<int> v;
int main()
{ int x;
in>>n;
for (int i=1; i<=n; ++i)
{
in>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (int i=0; i < n; ++i)
out<<v[i]<<" ";
return 0;
}