Merge pull request #522 from prashant2007-wq/main

solved the cp problem

Author: Dheeraj-06

Problems/Mathematics/Day-08/sol/prashant.cpp

@@ -0,0 +1,90 @@
+// ----------------------------------------------------------------------
+//                   ██████╗ ██████╗ ██████╗ ███████╗
+//                  ██╔════╝██╔═══██╗██╔══██╗██╔════╝
+//                  ██║     ██║   ██║██║  ██║█████╗
+//                  ██║     ██║   ██║██║  ██║██╔══╝
+//                  ╚██████╗╚██████╔╝██████╔╝███████╗
+//                   ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝
+// ----------------------------------------------------------------------
+//                       Prashant'S CP TEMPLATE
+//                           By praxxnnt06
+//                       "Think. Code. Conquer."
+// ----------------------------------------------------------------------
+#include<iostream>
+#include<vector>
+#include<algorithm>
+#include<unordered_map>
+#include<bit>
+#include<map>
+#include<set>
+#include<queue>
+#include<stack>
+#include<string>
+#include<iterator>
+#include<cmath>
+#include<iomanip>
+#include<climits>
+#include<cstdint>
+#include<cstdlib>
+using namespace std;
+#define ll long long
+#define int long long
+#define MOD 1000000007
+#define pb push_back
+#define all(v) v.begin(),v.end()
+#define rall(v) v.rbegin(),v.rend()
+#define sz(x) (int)(x).size()
+#define srt(v) sort(v.begin(),v.end())
+#define Rsrt(v) sort(v.begin(),v.end(),greater<int>())
+#define endl "\n"
+#define F first
+#define S second
+#define vi vector<int>
+#define vc vector<char>
+#define vb vector<bool>
+#define vvi vector<vector<int>>
+#define pii pair<int,int>
+#define umap unordered_map
+#define mii map<int,int>
+#define fr(i,a,b) for(int i=a;i<b;i++)
+#define frr(i,a,b) for(int i=a;i>b;i--)
+#define mxe(v) *max_element(v.begin(),v.end())
+#define mne(v) *min_element(v.begin(),v.end())
+void solve(){
+    int n,k;
+    cin>>n>>k;
+    vi a(n);
+    fr(i,0,n) cin>>a[i];
+    srt(a);
+    int remain=n-k;
+    int minPos=LLONG_MAX;
+    int maxPos=LLONG_MIN;
+    fr(i,0,k+1){
+        int start=i;
+        int end=i+remain-1;
+        if(end>=n) break;
+        
+        if(remain%2==1){
+            int mid=start+(remain-1)/2;
+            minPos=min(minPos,a[mid]);
+            maxPos=max(maxPos,a[mid]);
+        }
+        else{
+            int mid1=start+remain/2-1;
+            int mid2=start+remain/2;
+            minPos=min(minPos,a[mid1]);
+            maxPos=max(maxPos,a[mid2]);
+        }
+    }
+    cout<<maxPos-minPos+1<<endl;
+}
+signed main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t;
+    cin>>t;
+    while(t--){
+        solve();
+    }
+    return 0;
+}