# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575323 | 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.
/*
author : SilentVisitor;
created on 12.01.22 12.52 A.M.
*/
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#ifdef _DEBUG
#include "algo/debug.h"
#else
#define debug(...) 69420
#endif
#define deb(...) union
#define ll long long
#define i64 ll64_t
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define sz(s) s.size()
vector<char> data = {'a', 'e', 'i', 'o', 'u'};
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
void solve(){
int n;
cin >> n;
vector<int> a(n, 0);
for(auto &x : a) cin >> x;
function<void(int, vector<int>)> sort_even = [&](int n, vector<int> a) {
vector<int> dp;
for(int i = 0; i < n; i += 1){
if(!(a[i] & 1))
dp.push_back(a[i]);
sort(all(dp));
}
for(int x : dp)
cout << x << ' ';
cout << '\n';
};
sort_even(n, a);
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}