title: Difference Maximum Sum Minimum Sum N M Elementsin Review
signature: pub fn difference_maximum_sum_minimum_sum_n_m_elementsin_review(arr: Vec<i32>, n: i32, m: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, n: i32, m: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, n, m), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-92, -62, -50, -40, -32, -30, -18, -16, -14, -10, 24, 48, 54, 58, 94]), 8, 12, 
        206
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 0]), 1, 1, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-90, -58, 6, 16, 20, 34, 36, 38, 48, 66, 82, 84, 86, 90, 90]), 14, 8, 
        528
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([0, 0, 0, 1, 1]), 3, 2, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([7, 12, 15, 15, 21, 37, 40, 45, 50, 52, 53, 68, 68, 72, 75, 78, 86, 86, 88]), 16, 18, 
        2
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-88, -20, 22, 44, 72, 94]), 4, 3, 
        132
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([4, 11, 21, 25, 26, 30, 32, 38, 60, 63, 65, 75, 77, 87, 87, 96]), 12, 15, 
        19
      ));
      
  }
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 );
  }