# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18473 | jjhstop | 짝수 정렬 (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"
void sort_even(int N, int *A) {
int minVal;
for (int i = 0; i < N - 1; i++) {
minVal = i;
for (int j = i + 1; j < N; j++) {
if (A[j] < minVal) minVal = j;
}
if (minVal != i) {
int temp;
temp = A[minVal];
A[minVal] = A[i];
A[i] = temp;
}
}
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) Report(A[i]);
}
}