# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
146238 |
2019-08-23T00:57:53 Z |
Diuven |
짝수 정렬 (tutorial3) |
C++14 |
|
2 ms |
424 KB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
void sort_even(int N, int *A) {
vector<int> S;
for(int i = 0; i < N; i++) {
if(A[i] % 2 == 0) S.push_back(A[i]);
}
sort(S.begin(), S.end());
for(int x:S) Report(x);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
360 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
424 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
256 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 |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |