int minMove_CEH(int* students, int len)
{
	int zeroCount[2] = { 0, };
	int minMove[2] = { 0, };
	for (int i = 0; i < len; i++)
	{
		if (students[i] == 0)
			zeroCount[0]++;
		else
			minMove[0] += zeroCount[0];

		if (students[len - i - 1] == 0)
			zeroCount[1]++;
		else
			minMove[1] += zeroCount[1];
	}

	return minMove[0] < minMove[1] ? minMove[0] : minMove[1];
}

TEST(Algorithm2, Quiz) {
	EXPECT_EQ(minMove(new int[8]{ 1, 1, 1, 1, 0, 0, 0, 0 }, 8), 0);
	EXPECT_EQ(minMove(new int[8]{ 1, 0, 1, 1, 0, 0, 0, 0 }, 8), 2);
	EXPECT_EQ(minMove(new int[8]{ 0, 1, 0, 1, 1, 0, 1, 1 }, 8), 4);
}