# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145805 | 2019-08-21T07:01:57 Z | wesley2003 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <stdio.h> #include <assert.h> #include <malloc.h> #include <algorithm> using namespace std; int GetMax(int N,int *A){ int arr[20]={0,},cnt=0; for(int i=0;i<N;i++){ if(A[i]%2==0){ arr[cnt]=A[i]; cnt++; } } sort(arr,arr+cnt); return arr; }