| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145850 | lkm06042 | 짝수 정렬 (tutorial3) | C++14 | 2 ms | 396 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 <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
int sort_even(int N, int *A){
	vector<int> even;
	for (int i = 0; i < N; i++){
		if (A[i] % 2 == 0){
			even.push_back(A[i]);
		}
	}
	sort(even.begin(), even.end());
	for (auto it : even) {
		Report(it);
	}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
