# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151816 | 2019-09-05T03:33:21 Z | erebos | 짝수 정렬 (tutorial3) | C++17 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; void sort_even(int N, int *A) { vector<int>temp; for(int i = 0; i < N; i++) { if(A[i] % 2 == 0) temp.push_back(A[i]); } sort(temp.begin(), temp.end()) for(int i=0; i<temp.size(); ++i){ Report(temp[i]); } }