# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18923 | 2016-02-16T12:49:38 Z | dltldls95 | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> using namespace std; void sort_even(int N, int* A) { sort(A, A+N); for(int i =0; i<N; i++) { if(A[i] % 2 == 0) Report(A[i]); } }