Pagini recente » Cod sursa (job #4586) | Cod sursa (job #2890219) | Rezultatele filtrării | Cod sursa (job #1106638) | Cod sursa (job #1184236)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
struct comp
{
bool operator() (const int &a,const int &b)
{
return a>b;
}
};
ifstream fin("algsort.in");
ofstream fout("algsort.out");
priority_queue <int,vector<int>,comp> H;
int main()
{
int n,i,k;
fin>>n;
for(i=0;i<n;i++)
{
fin>>k;
H.push(k);
}
for(i=0;i<n;i++)
{
fout<<H.top()<<" ";
H.pop();
}
}