Cod sursa(job #1979458)
Utilizator | Data | 10 mai 2017 17:28:39 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <queue>
using namespace std;
priority_queue <int>q;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
int n,aux;
in>>n;
for(int i=1;i<=n;i++)
in>>aux,q.push(aux);
for(int i=1;i<=n;i++)
out<<q.top()<<" ",q.pop();
return 0;
}