Pagini recente » Cod sursa (job #2694124) | Cod sursa (job #978992) | Cod sursa (job #924833) | Cod sursa (job #1877103) | Cod sursa (job #1653878)
#include <iostream>
#include <fstream>
#include <queue>
#include <limits.h>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
//multiset<int> s;
priority_queue<int> s;
int main() {
int n,a;
int mx = INT_MAX;
in >> n;
for(int i = 0; i < n; i++) {
in >> a;
s.push(mx-a);
}
for(int i = 0; i < n; i++) {
out << mx-s.top() << " ";
s.pop();
}
}