[编程题] 赶去公司代码

import java.util.*;
public class Main {
     public static void main(String[] args) {
          
        Scanner in = new Scanner(System.in);
          
        while(in.hasNext()) {
            int n = in.nextInt();
            int[] tx = new int[n];
            for(int i=0;i<n;i++) {
                tx[i] = in.nextInt();
            }
            int[] ty = new int[n];
            for(int i=0;i<n;i++) {
                ty[i] = in.nextInt();
            }
            int gx = in.nextInt();
            int gy = in.nextInt();
            int wt = in.nextInt();
            int tt = in.nextInt();
            System.out.println(solve(tx, ty, gx, gy,wt,tt,n));
        }
          
    }
      
    private static int solve(int[] tx, int[] ty, int gx, int gy, int wt, int tt, int n) {
         
        int walk = (Math.abs(gx) + Math.abs(gy)) * wt;
         
        int drive = Integer.MAX_VALUE;
         
        for(int i = 0;i<n;i++) {
            int cost = (Math.abs(tx[i]) + Math.abs(ty[i])) * wt + (Math.abs(tx[i]-gx) + Math.abs(ty[i]-gy)) * tt;
            drive = Math.min(drive, cost);
        }
         
        return Math.min(drive, walk);
    }
}