Chocolate Distribution Problem

Author: sachuverma

DSA Crack Sheet/README.md

@@ -30,6 +30,7 @@
 - [Array Subset of another array](https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0 "view question") - [Cpp Solution](./solutions/Array%20Subset%20of%20another%20array.cpp) 
 - [Triplet Sum in Array](https://practice.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1# "view question") - [Cpp Solution](./solutions/Triplet%20Sum%20in%20Array.cpp)  
 - [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water-1587115621/1# "view question") - [Cpp Solution](./solutions/Trapping%20Rain%20Water.cpp)  
+- [Chocolate Distribution Problem](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0# "view question") - [Cpp Solution](./solutions/Chocolate%20Distribution%20Problem.cpp)  
 - []( "view question") - [Cpp Solution](./solutions/.cpp)  
 
 <!-- - []( "view question") - [Cpp Solution](./solutions/) -->

DSA Crack Sheet/solutions/Chocolate Distribution Problem.cpp

@@ -0,0 +1,69 @@
+/*
+Chocolate Distribution Problem
+==============================
+
+Given an array A of positive integers of size N, where each value represents number of chocolates in a packet. Each packet can have variable number of chocolates. There are M students, the task is to distribute chocolate packets such that :
+1. Each student gets one packet.
+2. The difference between the number of chocolates given to the students having packet with maximum chocolates and student having packet with minimum chocolates is minimum.
+
+Input:
+The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. Each test case consists of three lines. The first line of each test case contains an integer N denoting the number of packets. Then next line contains N space separated values of the array A denoting the values of each packet. The third line of each test case contains an integer m denoting the no of students.
+
+Output:
+For each test case in a new line print the minimum difference.
+
+Constraints:
+1 <= T <= 100
+1 <=N<= 107
+1 <= Ai <= 1018
+1 <= M <= N
+
+Example:
+Input:
+2
+8
+3 4 1 9 56 7 9 12
+5
+7
+7 3 2 4 9 12 56
+3
+
+Output:
+6
+2
+
+Explanation:
+Testcase 1: The minimum difference between maximum chocolates and minimum chocolates is 9-3=6
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+  int t;
+  cin >> t;
+  while (t--)
+  {
+    int n;
+    cin >> n;
+    vector<int> arr(n, 0);
+    for (auto &i : arr)
+      cin >> i;
+    int m;
+    cin >> m;
+
+    sort(arr.begin(), arr.end());
+    int ans = arr[m - 1] - arr[0];
+
+    int i = 1, j = m;
+    while (j < n)
+    {
+      ans = min(ans, arr[j] - arr[i]);
+      i++;
+      j++;
+    }
+    cout << ans << endl;
+  }
+  return 0;
+}