View Code of Problem 3699

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();
            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 (int j = 0; j < N; j++) {
                    int s = Math.abs(i-nums[j]);
                    if (f[j] - s > 0) min += (f[j] - s);
                }
                if (min < res) {
                    res = min;
                    index = i;
                }
            }
            System.out.println(index);
            System.out.println(res);
        }
    }
}