# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164281 | daddy0h | 짝수 정렬 (tutorial3) | C++11 | 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.
/// https://oj.uz/problem/view/tutorial3
#include <bits/stdc++.h>
using namespace std;
void sort_even(int N, int A[])
{
vector<int> even;
for(int id=0; id<N; ++id)
{
if(A[id] % 2 == 0) even.push_back(A[id]);
}
sort(even.begin(), even.end());
if(even.size() == 0) return;
else
{
for(int id=0; id<even.size(); ++id)
{
Report(even[id]);
}
}
}