# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12842 | 2015-01-10T00:29:46 Z | yongwhan | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include<algorithm> #include<vector> using namespace std; int sort_even(int N, int A[]) { vector<int> v(N); for (int i=0; i<N; i++) v[i]=A[i]; sort(v.begin(), v.end()); for (int i=0; i<N; i++) if(v[i]%2==0) Report(v[i]); return 0; }