Cod sursa(job #1248370)
| Utilizator | Data | 24 octombrie 2014 23:37:19 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
#include <vector>
int main()
{
std::ifstream in("algsort.in");
std::ofstream out("algsort.out");
unsigned int n, t;
std::vector<unsigned int> x;
in >> n;
for (unsigned int i=0; i<n; i++) {
in >> t;
x.push_back(t);
}
std::sort (x.begin(), x.end());
for (std::vector<unsigned int>::iterator i=x.begin(); i<x.end(); i++) out << *i << " ";
}
