# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16011 | 2015-08-06T16:26:27 Z | evenharder | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include "grader.h" #include<algorithm> void sort_even(int N, int[] A) { std::sort(A,A+N); for(int i=0;i<N;i++) { if(A[i]%2==0) { Report(A[i]); } } }