Cod sursa(job #1380258)
| Utilizator | Data | 7 martie 2015 04:43:32 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
vector < int > V;
void Read()
{
int N;
fin >> N;
for(int i = 1; i <= N; i++)
{
int x;
fin >> x;
V.push_back(x);
}
sort(V.begin(), V.end());
for(unsigned int i = 0; i < V.size(); i++)
fout << V[i] << " ";
}
int main()
{
Read();
return 0;
}
