# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667 | 2013-03-01T02:22:31 Z | jyuno426 | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include <algorithm> #include "grader.h" void sort_even(int N, int *A) { std::sort(A,A+N); for(i = 0; i < N; i++) if(A[i] % 2 == 0) Report(A[i]); }