| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 23360 |
2017-05-07T01:34:07 Z |
TAMREF |
짝수 정렬 (tutorial3) |
C++11 |
|
0 ms |
1172 KB |
#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 |
| 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 |
| # |
Verdict |
Execution time |
Memory |
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 |
