# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003 | 2013-06-15T02:18:11 Z | testtest | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include "grader.h" #include <algorithm> void sort_even(int N, int *A) { /*int last = 0; for(int i = 0;i < N;i++) if(A[i] & 1 == 0) A[last++] = A[i];*/ std::sort(A , A + N); for(int i = 0;i < N;i++) if(A[i] % 2 == 0) Report(A[i]);