Cod sursa(job #2311260)
| Utilizator | Data | 2 ianuarie 2019 20:27:50 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin ("algsort.in");
ofstream cout ("algsort.out");
int n;
long long v[500001];
cin >> n;
for (int i=1; i<=n; i++)
cin >> v[i];
for (int i=1; i<=n-1; i++)
for (int j=i+1; j<=n; j++)
if (v[i] > v[j])
swap(v[i], v[j]);
for (int i=1; i<=n; i++)
cout << v[i] << ' ';
return 0;
}
