| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145816 | junseo | 짝수 정렬 (tutorial3) | C++17 | 2 ms | 472 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 "grader.h"
#include <bits/stdc++.h>
using namespace std;
void sort_even(int N, int *A) {
vector<int> arr;
for(int i = 0; i < N; ++i)
{
if(A[i] % 2 == 0)
{
arr.push_back(A[i]);
}
}
sort(arr.begin(), arr.end());
for(auto i : arr)
Report(i);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
