| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145860 | ps_penguin | 짝수 정렬 (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 "grader.h"
#include <iostream>
using namespace std;
void sort_even(int N, int *A) {
	int i;
       sort(A,A+N);
	for(i = 0; i < N; i++) {
		if(A[i] % 2 == 0) Report(A[i]);
	}
}
