# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575328 | 2022-06-10T08:14:26 Z | SilentVisitor | 짝수 정렬 (tutorial3) | C++17 | 0 ms | 0 KB |
#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); }