# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145792 | 2019-08-21T06:57:29 Z | uvelo | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#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(); } }