# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243479 | prarie | 짝수 정렬 (tutorial3) | C++14 | 5 ms | 384 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 <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
void sort_even(int n, int *a) {
vector<int> res;
for (int i = 0; i < n; i++) if (a[i] % 2 == 0) res.push_back(a[i]);
sort(res.begin(), res.end());
for (int i = 0; i < res.size(); i++) Report(res[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |