#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());
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1172 KB |
Output is correct |
2 |
Correct |
0 ms |
1172 KB |
Output is correct |
3 |
Correct |
0 ms |
1172 KB |
Output is correct |
4 |
Correct |
0 ms |
1172 KB |
Output is correct |
5 |
Correct |
0 ms |
1172 KB |
Output is correct |
6 |
Correct |
0 ms |
1172 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1172 KB |
Output is correct |
2 |
Correct |
0 ms |
1172 KB |
Output is correct |
3 |
Correct |
0 ms |
1172 KB |
Output is correct |
4 |
Correct |
0 ms |
1172 KB |
Output is correct |
5 |
Correct |
0 ms |
1172 KB |
Output is correct |
6 |
Correct |
0 ms |
1172 KB |
Output is correct |
7 |
Correct |
0 ms |
1172 KB |
Output is correct |
8 |
Correct |
0 ms |
1172 KB |
Output is correct |