oj.uz

Submission #145801

# Submission time Handle Problem Language Result Execution time Memory
145801 2019-08-21T07:00:18 Z uvelo 짝수 정렬 (tutorial3) C++14
100 / 100
 2 ms 588 KB 
#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();
	}
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 488 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 372 KB Output is correct
5 Correct 2 ms 360 KB Output is correct
6 Correct 2 ms 256 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 356 KB Output is correct
8 Correct 2 ms 256 KB Output is correct