title: Difference Maximum Sum Minimum Sum N M Elementsin Review
signature: function difference_maximum_sum_minimum_sum_n_m_elementsin_review(arr, n, m)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(arr, n, m, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(arr, n, m), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver([2, 3, 6, 16, 21, 22, 23, 27, 27, 28, 29, 29, 31, 31, 37, 37, 38, 40, 41, 43, 51, 52, 53, 55, 55, 56, 57, 63, 67, 67, 67, 72, 75, 79, 82, 84, 91, 92, 93, 96, 96, 97], 21, 25, 167);
      @printf("TEST-0...%s\n",result);
      
      result = driver([-92, -62, -50, -40, -32, -30, -18, -16, -14, -10, 24, 48, 54, 58, 94], 8, 12, 206);
      @printf("TEST-1...%s\n",result);
      
      result = driver([0, 0], 1, 1, 0);
      @printf("TEST-2...%s\n",result);
      
      result = driver([1, 2, 2, 4, 5, 6, 7, 9, 10, 11, 11, 12, 13, 13, 16, 17, 21, 24, 29, 29, 34, 44, 44, 48, 49, 51, 54, 56, 59, 62, 63, 65, 65, 65, 71, 71, 76, 77, 77, 80, 83, 83, 84, 89, 91, 97, 99], 31, 34, 92);
      @printf("TEST-3...%s\n",result);
      
      result = driver([-90, -58, 6, 16, 20, 34, 36, 38, 48, 66, 82, 84, 86, 90, 90], 14, 8, 528);
      @printf("TEST-4...%s\n",result);
      
      result = driver([0, 0, 0, 1, 1], 3, 2, 0);
      @printf("TEST-5...%s\n",result);
      
      result = driver([7, 12, 15, 15, 21, 37, 40, 45, 50, 52, 53, 68, 68, 72, 75, 78, 86, 86, 88], 16, 18, 2);
      @printf("TEST-6...%s\n",result);
      
      result = driver([-88, -20, 22, 44, 72, 94], 4, 3, 132);
      @printf("TEST-7...%s\n",result);
      
      result = driver([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 25, 17, 8);
      @printf("TEST-8...%s\n",result);
      
      result = driver([4, 11, 21, 25, 26, 30, 32, 38, 60, 63, 65, 75, 77, 87, 87, 96], 12, 15, 19);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def difference_maximum_sum_minimum_sum_n_m_elementsin_review(arr, n, m):
      max = 0
      min = 0
      arr.sort()
      j = (n - 1)
      for i in range(m):
          min += arr[i]
          max += arr[j]
          j = (j - 1)
      return (max - min)
source_cpp: int difference_maximum_sum_minimum_sum_n_m_elementsin_review(vector<int> arr, int n, int m) {
    int max = 0, min = 0;
    sort(arr.begin(), arr.end());
    for ( int i = 0, j = n - 1;
    i < m;
    i ++, j -- ) {
      min += arr [ i ];
      max += arr [ j ];
    }
    return ( max - min );
  }