# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145803 | 2019-08-21T07:01:48 Z | xxxxorb0221 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include<algorithm> #include<vector> using namespace std; void sort_even(int N, int* A){ vector<int> E; for (int i = 0; i<N; i++) { if (A[i] % 2 == 0) E.push_back(A[i]); } sort(E.begin(), E.end()); int size = E.size(); for (int i = 0; i < size; i++) Report(E[i]); }