Cod sursa(job #527774)
Utilizator | Data | 1 februarie 2011 11:30:16 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <vector>
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f ("algsort.in");
ofstream g ("algsort.out");
int n,a;
vector <int> x (0);
f >> n ;
for (int i = 1 ; i <= n ; i++)
{
f >> a;
x.push_back (a);
}
sort(x.begin(), x.end());
for (int i = 0 ; i < n ; i++)
g << x[i] << " ";
return 0;
}