# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145800 | 2019-08-21T07:00:11 Z | kst7703 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> using namespace std; void sort_even(int n, int *arr) { vector<int> even; for (int i = 1; i < n; i++) if (arr[i] % 2 == 0) even.push_back(arr[i]); sort(even.begin(), even.end()); for (auto it : even) Report(it); }