# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14496 | 2015-05-18T10:19:25 Z | ggoh | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include<cstdio> #include<algorithm> int sort_even(int N,int *A) { int B[100]={},t=0,i; for(i=0;i<N;i++) { if(A[i]%2==0) { B[t++]=A[i]; } std::sort(B,B+t); for(i=0;i<t;i++)Report(S[i]); } }