Cod sursa(job #2214875)
| Utilizator | Data | 20 iunie 2018 13:20:22 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{int n,i,j,x;
f>>n;
vector<int> a;
for(i=1;i<=n;i++)
{
f>>x;
a.push_back(x);
}
std::sort(a.begin(),a.end());
vector<int>::iterator it;
for(it=a.begin();it!=a.end();it++)
g<<(*it)<<" ";
return 0;
}
