Submission #145801

#TimeUsernameProblemLanguageResultExecution timeMemory
145801uvelo짝수 정렬 (tutorial3)C++14
100 / 100
2 ms588 KiB
#include <iostream>
#include <queue>
#include <functional>
#include "grader.h"
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();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...