# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808 | 2013-03-03T06:27:21 Z | hana5505 | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include<algorithm> using namespace std; int GetMax(int N, int *A){ int i; sort(A,A+N); for(i=0;i<N;i++) if(A[i]%2==0) Report(i); return 0; }