Cod sursa(job #751385)
| Utilizator | Data | 25 mai 2012 21:59:22 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define dim 500000
int v[dim];
struct cmp
{
bool operator () (const int &a, const int &b)
{
return v[a]>v[b];
}
};
priority_queue <int,vector <int> ,cmp> Heap;
int main()
{
long n, i;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for(i=1;i<=n;++i)
{
fin>>v[i];
Heap.push(i);
}
for(;!Heap.empty();Heap.pop())
fout<<v[Heap.top()] <<" ";
return 0;
}