# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666 | jyuno426 | 짝수 정렬 (tutorial3) | C++98 | 0 ms | 0 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 <algorithm>
void sort_even(int N, int *A) {
int m = 0;
for(i = 0; i < N; i++)
{
if(A[i] % 2 == 0)
A[m++] = A[i];
}
std::sort(A,A+m);
for(i = 0; i < m; i++) Report(A[i]);
}