Cod sursa(job #527539)
Utilizator | Data | 31 ianuarie 2011 20:31:12 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <vector>
using namespace std;
int main()
{
vector <int> v;
int n;
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for(int i = 1; i <= n; ++i)
{
int nr;
f >> nr;
v.push_back(nr);
}
sort(v.begin(), v.end());
for(int i = 0; i < n; ++i)
g << v[i] << " ";
f.close();
g.close();
return 0;
}