oj.uz

Submission #18476

# Submission time Handle Problem Language Result Execution time Memory
18476 2016-02-05T13:58:48 Z jjhstop 짝수 정렬 (tutorial3) C++
100 / 100
 0 ms 1084 KB 
#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] < A[minVal]) minVal = j;
		}
		if (minVal != i) {
			int temp;
			temp = A[minVal];
			A[minVal] = A[i];
			A[i] = temp;
		}
	}

	for(int i = 0; i < N; i++) {
		if(A[i] % 2 == 0) Report(A[i]);
	}
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct