Cod sursa(job #3163598)
| Utilizator | Data | 31 octombrie 2023 17:48:19 | |
|---|---|---|---|
| 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;
priority_queue <int, vector <int> , greater <int> > pq;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n;
cin >> n;
for(int i = 1; i <= n; i ++)
{
int x;
cin >> x;
pq.push(x);
}
while(!pq.empty())
{
cout << pq.top() << " ";
pq.pop();
}
return 0;
}
