| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 7904 | gs14004 | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 1204 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 "grader.h"
#include <queue>
using namespace std;
void sort_even(int N, int *A) {
priority_queue<int,vector<int>,greater<int> > pq;
for (int i=0; i<N; i++) {
if(A[i]%2 == 0) pq.push(A[i]);
}
while (!pq.empty()) {
Report(pq.top());
pq.pop();
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
