# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14487 | nosiar | 짝수 정렬 (tutorial3) | C++98 | 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>
int sort_even(int N, int *A)
{
std::vector<int> x;
for (int i = 0; i < N; ++i) if (A[i] % 2 == 0) x.push_back(A[i]);
std::sort(x.begin(), x.end());
for (int i : x) Report(i);
}