# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145831 | 2019-08-21T07:06:23 Z | wesley2003 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> #include "grader.h" using namespace std; void sort_even(int n, int *arr) { int a[1200],cnt=0; for (int i = 0; i < n; i++) if (arr[i] % 2 == 0){ a[cnt]=arr[i]; cnt++; } sort(a, a+cnt); for (auto it : even) Report(it); }