# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525231 | 2022-02-11T07:17:31 Z | pokmui9909 | 짝수 정렬 (tutorial3) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; int GetMax(int N, int *A){ vector<ll> V; for(int i = 0; i < N; i++){ if(A[i] % 2 == 0){ V.push_back(A[i]); } } sort(V.begin(), V.end()); for(int i = 0; i < V.size(); i++){ Report(V[i]); } }