Cod sursa(job #2462958)
Utilizator | Data | 28 septembrie 2019 09:36:11 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
priority_queue <int,vector<int>,greater<int>> mh;
int n,i,x;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>x;
mh.push(x);
}
for(i=1;i<=n;++i)
{
g<<mh.top()<<' ';
mh.pop();
}
return 0;
}