Cod sursa(job #878242)
| Utilizator | Data | 14 februarie 2013 10:42:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
vector<int> a;
int N;
in >> N; a.resize(N);
for (int i = 0; i < N; ++i)
in >> a[i];
sort(a.begin(),a.end());
for (int i = 0; i < N; ++i)
out << a[i] << " ";
in.close();
out.close();
return 0;
}
