# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145805 | wesley2003 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}