# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145830 | 2019-08-21T07:06:07 Z | lkyeon328 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <iostream> #include <algorithm> #include "greader.h" #include <vector> using namespace std; int sort_even(int n, int *arr){ for (int i = 0; i < n; i++){ if (arr[i] % 2 == 0); else v.push_back(arr[i]) } sort(v.begin(), v.end()); for (auto i : v) Refort v[i]; }