Cod sursa(job #560399)
Utilizator | Cornigeanu Calin Sadmann | Data | 18 martie 2011 14:35:46 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int n,x;
priority_queue<int, vector<int>,greater<int> >V;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
V.push(x);
}
for(int i=1;i<=n;i++)
{
out<<V.top()<<" ";
V.pop();
}
return 0;
}