import java.util.*; public class Main { public static void main(String[] args) { Scanner in =new Scanner(System.in); while(in.hasNext()) { int l =in.nextInt(); int n =in.nextInt(); int[] k = new int[n]; for(int i =0;i<n;i++) { k[i]=in.nextInt(); } int[] f = new int[n]; for(int i =0;i<n;i++) { f[i]=in.nextInt(); } int minloc=0; int min = Integer.MAX_VALUE; for(int i =0;i<=l;i++) { int lost=0; for(int j=0;j<n;j++) { int s = Math.abs(i-k[j]); int damage = f[j]-s; if(damage<0) { damage=0; } lost+=damage; } if(lost<min) { min=lost; minloc=i; } } System.out.println(minloc); System.out.println(min); } } } |
Double click to view unformatted code.