# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1205296 | Trn115 | 짝수 정렬 (tutorial3) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
void sort_even(int N, int *A)
{
vector<int> even;
for (int i = 0; i < N; i++) {
if (A[i] % 2 == 0) {
even.push_back(A[i]);
}
}
sort(even.begin(), even.end());
for (int i = 0; i < even.size(); i++) {
Report(even[i]);
}
}