# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14488 |
2015-05-17T14:16:35 Z |
nosiar |
짝수 정렬 (tutorial3) |
C++14 |
|
0 ms |
1208 KB |
#include <algorithm>
#include <vector>
#include "grader.h"
int sort_even(int N, int *A)
{
std::vector<int> x;
for (int i = 0; i < N; ++i) if (A[i] % 2 == 0) x.push_back(A[i]);
std::sort(x.begin(), x.end());
for (int i : x) Report(i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1208 KB |
Output is correct |
2 |
Correct |
0 ms |
1208 KB |
Output is correct |
3 |
Correct |
0 ms |
1208 KB |
Output is correct |
4 |
Correct |
0 ms |
1208 KB |
Output is correct |
5 |
Correct |
0 ms |
1208 KB |
Output is correct |
6 |
Correct |
0 ms |
1208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1208 KB |
Output is correct |
2 |
Correct |
0 ms |
1208 KB |
Output is correct |
3 |
Correct |
0 ms |
1208 KB |
Output is correct |
4 |
Correct |
0 ms |
1208 KB |
Output is correct |
5 |
Correct |
0 ms |
1208 KB |
Output is correct |
6 |
Correct |
0 ms |
1208 KB |
Output is correct |
7 |
Correct |
0 ms |
1208 KB |
Output is correct |
8 |
Correct |
0 ms |
1208 KB |
Output is correct |