| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 151813 | erebos | 짝수 정렬 (tutorial3) | C++17 | 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 <bits/stc++.h>
using namespace std;
void sort_even(int N, int *A) {
vector<int>temp;
int i;
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) temp.push_back(A[i]);
}
sort(temp.begin(), temp.end());
}