Cod sursa(job #2360438)
Utilizator | Data | 1 martie 2019 20:29:44 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
const int DIM = 500001;
int sir[DIM];
int n;
int main()
{
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> sir[i];
sort(sir + 1, sir + n + 1);
for (int i = 1; i <= n; ++i)
cout << sir[i] << ' ';
return 0;
}