# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145817 | 2019-08-21T07:04:49 Z | hahorse | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <stdio.h> #include <vector> #include <algorithm> using namespace std; int sort_even(int n, int *a){ vector <int > v; for(int i=0;i<n;i++){ if(a[i]%2==0){ v.push_back(a[i]); } } sort(v.begin(),v.end(); for(auto it:v){ Report(it); } }