while (days < maxDay) { int max = -1; int index = -1; for (int i = 0; i < M.length; i++) { if (M[i]>max){ max = M[i]; index = i; } } if (max != -1 && index != -1) { days++; maxMoney += max; M[index] = M[index] - D[index]; if (M[index] <= 0){ M[index] = 0; } } }