Pagini recente » Cod sursa (job #1871948) | Cod sursa (job #2639890) | Cod sursa (job #1337602) | Cod sursa (job #1146085) | Cod sursa (job #1653924)
#include <iostream>
#include <fstream>
#include <queue>
#include <stdio.h>
#include <fstream>
#define MAX 10000
using namespace std;
FILE *fin = fopen("algsort.in", "r");
ofstream out("algsort.out");
char c[MAX];
int k = MAX;
inline char nextch() {
if(k == MAX) {
fread(c, 1, MAX, fin);
k = 0;
}
return c[k++];
}
int x;
char ch;
inline int read() {
x = 0;
ch = nextch();
while(!isdigit(ch))
ch = nextch();
while(isdigit(ch)) {
x = x*10 + ch - '0';
ch = nextch();
}
return x;
}
priority_queue<int, vector<int>, greater<int>> s;
int main() {
int n,a;
n = read();
for(int i = 0; i < n; i++) {
s.push(read());
}
for(int i = 0; i < n; i++) {
out << s.top() << " ";
s.pop();
}
}