# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
31361 |
2017-08-20T11:21:55 Z |
topology |
짝수 정렬 (tutorial3) |
C++14 |
|
0 ms |
2016 KB |
#include <bits/stdc++.h>
using namespace std;
void sort_even(int n, int *a) {
vector<int> b;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 0) b.push_back(a[i]);
}
sort(b.begin(), b.end());
for (auto &val : b) {
printf("%d\n", val);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
7 |
Correct |
0 ms |
2016 KB |
Output is correct |
8 |
Correct |
0 ms |
2016 KB |
Output is correct |