Cod sursa(job #642617)
Utilizator | c a e n caen1 | Data | 1 decembrie 2011 20:19:51 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
#define IN "algsort.in"
#define OUT "algsort.out"
vector<long> v;
int main() {
long n, i, x;
ifstream fin(IN); ofstream fout(OUT);
fin >> n;
for(i = 0; i < n; ++i) {
fin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for(i = 0; i < n; ++i)
fout << v[i] << ' ';
fout << '\n';
return 0;
}