# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
540 | 2013-02-28T12:09:14 Z | a01077483940 | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include<algorithm> using namespace std; void sort_even (int N, int *A) { sort (A, A+N); for (int i=0; i<N; i++) if (A[i]%2 == 0) Report(A[i]); }