| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145803 | xxxxorb0221 | 짝수 정렬 (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<algorithm>
#include<vector>
using namespace std;
void sort_even(int N, int* A){
	vector<int> E;
	for (int i = 0; i<N; i++)
	{
		if (A[i] % 2 == 0)
			E.push_back(A[i]);
	}
	sort(E.begin(), E.end());
	int size = E.size();
	for (int i = 0; i < size; i++)
		Report(E[i]);
}
