Cod sursa(job #1681491)
Utilizator | Data | 9 aprilie 2016 15:14:09 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<iostream>
#include<queue>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
priority_queue<int >pq;
int main ()
{
int a,i,n;
cin>>n;
for(i=1; i<=n; i++)
{
f>>x;
pq.push(-x);
}
for(i=1; i<=n; i++)
{
g<<-pq.top()<<" ";
pq.pop();
}
}