| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145815 | j07801 | 짝수 정렬 (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<algorithm>
using namespace std;
int B[1000000];
int sort_even(int N,*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
}
