import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while(scanner.hasNext()) { int L = scanner.nextInt(); int N = scanner.nextInt(); // Map<Integer, Integer> map = new HashMap<>(); int[] nums = new int[N]; int[] f = new int[N]; for (int i = 0; i < N; i++) { nums[i] = scanner.nextInt(); } for (int i = 0; i < N; i++) { f[i] = scanner.nextInt(); } int res = Integer.MAX_VALUE; int index = 0; for (int i = 0; i <= L; i++) { int min = 0; // for (Integer key : map.keySet()) { // int s = Math.abs(key - i); // int f = map.get(key); // if (f - s > 0) min += (f - s); // } for (int j = 0; j < N; j++) { int s = Math.abs(i-nums[j]); int damage = f[j]-s; if(damage<0) { damage=0; } min+=damage; } if (min < res) { res = min; index = i; } } System.out.println(index); System.out.println(res); } } } |
Double click to view unformatted code.