# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4963 | 2014-01-23T16:04:48 Z | lingxiang | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include "grader.h" #include<algorithm> 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]); }