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 std::priority_queue;
void sort_even(int N, int *A) {
	int i;
	priority_queue<int> Q;
	for(i = 0; i < N; i++) {
		if(A[i] % 2 == 0) Q.push(-A[i]);
	}
	for(;!Q.empty();Q.pop()) Report(-Q.top());
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |