# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14802 | 2015-06-26T07:38:58 Z | aloshipda | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include <algorithm> #include "grade.h" using namespace std; void sort_even(int N, int *A) { int i; sort(A,A+N); for(i = 0; i < N; i++) { if(A[i] % 2 == 0) Report(A[i]); } }