Cod sursa(job #306709)
Utilizator | Data | 21 aprilie 2009 20:24:54 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<queue>
using namespace std;
int main() {
ifstream f("stl.in");
ofstream g("stl.out");
int n, i, x;
priority_queue<int> lista;
vector<int>a;
vector<int>::iterator it;
f>>n;
for(i = 1; i <= n; i++) {
f>>x;
lista.push(x); }
while(!lista.empty()) {
a.push_back(lista.top());
lista.pop(); }
reverse(a.begin(), a.end());
for(it = a.begin(); it != a.end(); it++)
g<<*it<<" ";
return 0;
}