| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 13900 | minsu | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 1720 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 <vector>
#include <algorithm>
#include <iostream>
using namespace std;
void sort_even(int N, int *A){
vector<int> newA;
for(int i=0;i<N;i++)
if(A[i]%2==0) newA.push_back(A[i]);
sort(newA.begin(), newA.end());
for(int i : newA) Report(i);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||