fork download
  1. import java.util.Arrays;
  2. import java.util.Scanner;
  3.  
  4. public class Main {
  5. public static void main(String[] args) {
  6. Solution sol = new Solution();
  7.  
  8.  
  9. int[] a = {3, 1, 1};
  10. int[] b = {6, 5, 4};
  11.  
  12.  
  13. int result = sol.minProductSum(a, b);
  14.  
  15. System.out.println("Minimum Product Sum: " + result);
  16. }
  17. }
  18.  
  19. class Solution {
  20. public int minProductSum(int[] a, int[] b) {
  21. Arrays.sort(a);
  22. Arrays.sort(b);
  23.  
  24. int totalSum = 0;
  25. int n = a.length;
  26.  
  27. for (int i = 0; i < n; i++) {
  28. totalSum += a[i] * b[n - 1 - i];
  29. }
  30.  
  31. return totalSum;
  32. }
  33. }
  34.  
Success #stdin #stdout 0.09s 53628KB
stdin
Standard input is empty
stdout
Minimum Product Sum: 23