Cod sursa(job #1539896)
Utilizator | Data | 1 decembrie 2015 19:19:35 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> v;
long long x;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
f >> n;
for(int i=0; i<n; i++)
{
f >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for(int i=0; i<n; i++)
{
g << v[i] << " ";
}
f.close();
g.close();
return 0;
}