Cod sursa(job #1653878)
| Utilizator | Data | 16 martie 2016 17:48:14 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#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();
}
}
