Cod sursa(job #2299796)
| Utilizator | Data | 10 decembrie 2018 09:26:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int n, v[500005], x;
//vector <int> v;
int main()
{
in >> n;
for (int i=1; i<=n; i++)
in >> v[i];
sort(v+1,v+1+n);
for (int i=1; i<=n; i++)
out << v[i] << " ";
/*for (int i=0; i<n; i++)
{
in >> x;
v.push_back(x);
}
sort(v.begin(),v.end());
for (int i=0; i<n; i++)
out << v[i] << " ";*/
return 0;
}
