Submission #145839

# Submission time Handle Problem Language Result Execution time Memory
145839 2019-08-21T07:07:41 Z j07801 짝수 정렬 (tutorial3) C++14
100 / 100
2 ms 384 KB
#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 time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct