Cod sursa(job #1893851)
Utilizator | Robert Trifan trifangrobert | Data | 26 februarie 2017 08:34:56 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n, v[500005];
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for (int i = 1;i <= n;i++)
f >> v[i];
f.close();
//for(int i=1;i<=n;i++)
// for(int j=i+1;j<=n;j++)
// if (v[i] > v[j])
// {
// swap(v[i], v[j]);
// }
sort(v+1, v+n+1);
for (int i = 1;i <= n;i++)
g << v[i] << " ";
g << "\n";
g.close();
return 0;
}