oj.uz

Submission #7904

# Submission time Handle Problem Language Result Execution time Memory
7904 2014-08-24T08:59:08 Z gs14004 짝수 정렬 (tutorial3) C++
100 / 100
 0 ms 1204 KB 
#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();
    }
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1204 KB Output is correct
2 Correct 0 ms 1204 KB Output is correct
3 Correct 0 ms 1204 KB Output is correct
4 Correct 0 ms 1204 KB Output is correct
5 Correct 0 ms 1204 KB Output is correct
6 Correct 0 ms 1204 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1204 KB Output is correct
2 Correct 0 ms 1204 KB Output is correct
3 Correct 0 ms 1204 KB Output is correct
4 Correct 0 ms 1204 KB Output is correct
5 Correct 0 ms 1204 KB Output is correct
6 Correct 0 ms 1204 KB Output is correct
7 Correct 0 ms 1204 KB Output is correct
8 Correct 0 ms 1204 KB Output is correct