# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14487 | 2015-05-17T14:16:15 Z | nosiar | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include <algorithm> #include <vector> 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); }