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