# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145838 | lkyeon328 | 짝수 정렬 (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 <iostream>
#include <algorithm>
#include "grader.h"
#include <vector>
using namespace std;
int sort_even(int n, int *arr){
vector <int> v;
for (int i = 0; i < n; i++){
if (arr[i] % 2 == 0);
else v.push_back(arr[i])
}
sort(v.begin(), v.end());
for (auto i : v) Refort(v[i]);
}