Cod sursa(job #1014876)
Utilizator | Data | 23 octombrie 2013 16:41:45 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <queue>
#include <fstream>
using namespace std;
int main(int argc, char *argv[])
{
int n;
priority_queue<int> pq;
ifstream in("algsort.in");
in >> n;
for(int c = 1, x; c <= n; ++c) in >> x, pq.push(x);
ofstream out("algsort.out");
while(!pq.empty()) out << pq.top() << ' ', pq.pop();
return 0;
}