Cod sursa(job #918712)
| Utilizator | Data | 19 martie 2013 08:12:59 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in ("algsort.in"); ofstream out ("algsort.out");
int main()
{
int n;
vector<int> nrs;
in >> n;
for(int i = 0; i < n; i++)
{
int t;
in >> t;
nrs.push_back(t);
}
sort(nrs.begin(),nrs.end());
for(int i = 0; i < n; i++)
out << nrs[i] << ' ';
out << '\n';
return 0;
}
