PG Battle2019解き直し～その1～

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int result = 0;
		// 整数の入力
		int n = sc.nextInt();
		int k = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			if (a > k) {
				result = result + a - k;
			}
		}
		System.out.println(result);
	}
}

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long result = 0; // ここがオーバーフローしてた
		// 整数の入力
		int n = sc.nextInt();
		int k = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			if (a > k) {
				result = result + a - k;
			}
		}
		System.out.println(result);
	}
}

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int result = 0;
		// 整数の入力
		int n = sc.nextInt();
		int m = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		if (a == 0 && b == 0 && c == 0 && m == 0) {
			System.out.println(n + " 0 0");
			return;
		}
		for (int aNum = 0; aNum < n + 1; aNum++) {
			int x = (m - b * n - (a - b) * aNum);
			int y = c - b;
			int cNum = x / y;
			int bNum = n - aNum - cNum;
			if (a * aNum + b * bNum + c * cNum == m && aNum >= 0 && bNum >= 0 && cNum >= 0) {
				System.out.println(aNum + " " + bNum + " " + cNum);
				return;
			}
		}
		System.out.println("-1 -1 -1");
	}
}

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		long n = sc.nextInt();
		long m = sc.nextLong();
		long a = sc.nextInt();
		long b = sc.nextInt();
		long c = sc.nextInt();
		if (a == b && a == c) {
			// 3匹の足の本数が同じ場合
			if (a * n == m) {
				System.out.println(n + " 0 0");
				return;
			}
			System.out.println("-1 -1 -1");
			return;
		}
		if (a == b || b == c || c == a) {
			long aNum = 0;
			long bNum = 0;
			long cNum = 0;
			if (a == b) {
				long x = m - b * n;
				long y = c - b;
				cNum = x / y;
				bNum = n - cNum;
			}
			if (b == c) {
				long x = m - c * n;
				long y = a - c;
				aNum = x / y;
				cNum = n - aNum;
			}
			if (c == a) {
				long x = m - a * n;
				long y = b - a;
				bNum = x / y;
				aNum = n - bNum;
			}
			if (a * aNum + b * bNum + c * cNum == m && aNum >= 0 && bNum >= 0 && cNum >= 0) {
				System.out.println(aNum + " " + bNum + " " + cNum);
				return;
			}
			System.out.println("-1 -1 -1");
			return;
		}
		for (long aNum = 0; aNum < n + 1; aNum++) {
			long x = (m - b * n - (a - b) * aNum);
			long y = c - b;
			long cNum = x / y;
			long bNum = n - aNum - cNum;
			if (a * aNum + b * bNum + c * cNum == m && aNum >= 0 && bNum >= 0 && cNum >= 0) {
				System.out.println(aNum + " " + bNum + " " + cNum);
				return;
			}
		}
		System.out.println("-1 -1 -1");
	}
}