# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575328 | SilentVisitor | 짝수 정렬 (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/stdc++.h>
using namespace std;
#define ll long long
void sort_even(){
int n;
cin >> n;
vector<int> a(n, 0);
for(auto &x : a) cin >> x;
function<void(int, vector<int>)> check = [&](int n, vector<int>) {
vector<int> dp;
for(int i = 0; i < n; i += 1){
if(!(a[i] & 1))
dp.push_back(a[i]);
}
sort(dp.begin(), dp.end());
for(int x : dp)
Report(x);
};
check(n, a);
}