Cod sursa(job #806217)
| Utilizator | Data | 2 noiembrie 2012 01:05:53 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
fstream f("algsort.in", ios::in);
fstream g("algsort.out", ios::out);
int N, i, tmp;
f >> N;
vector<int> v;
for (i = 0; i < N; i++) {
f >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
for (i = 0; i < N; i++)
g << v[i] << " ";
f.close();
g.close();
return 0;
}
