Cod sursa(job #1184236)
Utilizator | Data | 11 mai 2014 19:55:27 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#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();
}
}