# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146236 | 2019-08-23T00:57:35 Z | Diuven | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; void sort_even(int N, int *A) { vector<int> S; for(int i = 0; i < N; i++) { if(A[i] % 2 == 0) S.push_back(A[i]); } sort(S.begin(), S.end()); for(int x:S) report(x); }