Cod sursa(job #561441)
Utilizator | Data | 20 martie 2011 14:06:48 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
#include <queue>
using namespace std;
int n;
priority_queue<int, vector<int>, greater<int> > sir;
int sec;
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf("%d", &sec);
sir.push(sec);
}
for (int i = 0; i < n; ++i)
{
printf("%d ", sir.top());
sir.pop();
}
printf("\n");
return 0;
}