Submission #145809

#TimeUsernameProblemLanguageResultExecution timeMemory
145809wesley2003짝수 정렬 (tutorial3)C++14
0 / 100
2 ms376 KiB
#include <stdio.h>
#include <assert.h>
#include <malloc.h>
#include <algorithm>
using namespace std;
int sort_even(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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...