Cod sursa(job #1962029)
Utilizator | Solcan Mihai Andrei SolcanMihai | Data | 11 aprilie 2017 15:31:33 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 500005;
int n;
int sir[N];
void citire()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%d", &sir[i]);
}
}
void solve()
{
sort(sir, sir + n);
}
void afisare()
{
for(int i = 0; i < n; i++)
{
printf("%d ", sir[i]);
}
}
int main()
{
freopen("algosort.in", "r", stdin);
freopen("algosort.out", "w", stdout);
citire();
solve();
afisare();
return 0;
}