chocola.java

import java.util.*;
public class chocola{
    public static void main(String[] args) {
        Scanner kb=new Scanner(System.in);

        int n=6;
        int m=4;
        Integer costver[]={2,1,3,1,4};
        Integer costhor[]={4,1,2};
        Arrays.sort(costver,Collections.reverseOrder());
        Arrays.sort(costhor,Collections.reverseOrder());
        int h=0,v=0;
        int hp=1,vp=1;
        int cost=0;
        while(h<costhor.length && v<costver.length){
            if(costver[v]<=costhor[h]){
                cost+= costhor[h]*hp;
                hp++;h++;
            }
            else{
                cost+=costver[v]*hp;
                vp++;v++;
            }
        }
        while(h<costhor.length){
            cost+=costhor[h]*vp;
            hp++;h++;

        }
        while(v<costver.length){
            cost+=costver[v]*hp;
            vp++;v++;
        }
        System.out.println("Min cost of cuts:"+cost);
    }
}