Cod sursa(job #721834)
| Utilizator | Data | 24 martie 2012 11:50:11 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#include <queue>
std::priority_queue<int>s;
int a[500005];
int main(){
int n,x;
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x);
s.push(x); }
n=0;
for(;s.size()>0;){
a[++n]=s.top();
s.pop(); }
for(;n>0;n--)printf("%d ",a[n]);
}
