TopCoder SRM 634 Div1 Easy: ShoppingSurveyDiv1

解法

kmjp.hatenablog.jp

コード

import java.util.Arrays;

public class ShoppingSurveyDiv1 {

	public int minValue(int N, int K, int[] s) {
		for (int p = 0; p <= N; p++) {
			int[] copyS = Arrays.copyOf(s, s.length);
			int sum = 0;
			for (int i = 0; i < copyS.length; i++) {
				copyS[i] = Math.max(0, copyS[i] - p);
				sum += copyS[i];
			}
			if (sum <= (N - p) * (K - 1)) {
				return p;
			}
		}

		return 0;
	}

}