Question

Please use Java to solve this problem

Problem Cases Output 05m 465 The current selected programming language is Java. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use System.out.printin to debug your code. The System.out.printin) may not work in case of syntax/runtime error. The version of JDK being used is 1.8 Amazon Fresh trucks can hold two containers on each shelf, provided the sum of their weights does not exceed the given maximum capacity of the shelf. To most efficiently pack the trucks for delivery, each shelf should be loaded with the heaviest two containers that the shelf can support. Write an algorithm to find the weights of two containers chosen to be carried on the shelf. Input The input to the function/method consists of three arguments numContainers, an integer representing the number of containers, maxCapacity, a real number representing the maximum capacity of the shelf containersWt, a list of real numbers representing the weight of the containers. Output Return a pair of real numbers representing the weights of the two heaviest containers chosen to be carried on the shelf. Constraints 0 containersWti O si numcontainers Note There is at least one pair whose combined weight is less than or equals to the maximum capacity of the shelf If more than one such pair is possible, then output any one of them. The order of numbers in the output does not matter Example Input numContainers 6 maxCapacity 433

Answer 1

TwoHeaviest.java

import java.util.Arrays;

public class TwoHeaviest {
    public static class Pair {
        double first;
        double second;
        Pair(double first, double second) {
            this.first = first;
            this.second = second;
        }
    }

    public static Pair solution(int numContainers, double maxCapacity, double[] containersWt) {
        Arrays.sort(containersWt);
        int r = numContainers - 1;
        double max = 0;
        Pair ans = null;
        for (int l = 0; l < r; l ++) {
            while (r > l && containersWt[l] + containersWt[r] > maxCapacity) r --;
            if (r > l && containersWt[l] + containersWt[r] > max) {
                max = containersWt[l] + containersWt[r];
                ans = new Pair(containersWt[l], containersWt[r]);
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        int numContainers = 6;
        double maxCapacity = 33.3;
        double[] containersWt = {7.33, 8.13, 103.7313, 11.24, 23.79, 18.3501};
        Pair ans = solution(numContainers, maxCapacity, containersWt);
        System.out.println(ans.first + " " + ans.second);
    }
}