# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145860 | 2019-08-21T07:22:04 Z | ps_penguin | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include "grader.h" #include <iostream> 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]); } }