# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145792 | uvelo | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <queue>
#include <functional>
using namespace std;
priority_queue<int, vector<int>, greater<int> > pq;
void sort_even(int n,int* a){
for (int i = 0; i < n; i++){
if (a[i] & 1) continue;
pq.push(a[i]);
}
while (!pq.empty()){
Report(pq.top()); pq.pop();
}
}