Submission #145839

#TimeUsernameProblemLanguageResultExecution timeMemory
145839j07801짝수 정렬 (tutorial3)C++14
100 / 100
2 ms384 KiB
#include<stdio.h>
#include<algorithm>
#include "grader.h"
using namespace std;
int B[1000000];
int sort_even(int N,int *A){

	int cnt = 0;
	for (int i = 0; i < N; i++){
		if (A[i] % 2 == 0){
			B[cnt++] = A[i];
		}
	}
	sort(B, B + cnt);
	for (int i = 0; i < cnt; i++){
		Report(B[i]);
	}

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...