Entrance exam

help
1

I am facing Wa in a question i tried it hard

The link to question is

My solution is

#include<bits/stdc++.h>
using namespace std;
/*
do not voilate rules
*/
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}

int main()
{
fastio();
int t;//number of testcase
cin>>t;
while(t–)
{
int n,k,e,m;

  cin>>n>>k>>e>>m;
  
  int arr[e];
  vector<int>v;
 int last_sum; 
  while(n--)
  {
      int sum=0;
      if(n==0)
       e--;
     for(int i=0;i<e;i++)
     {
       cin>>arr[i];
       
       sum=sum+arr[i];
     } 
    
     if(n>0)
     v.push_back(sum);
     else
     last_sum=sum;
}

 
sort(v.begin(),v.end());

 if(last_sum>=v[k-1])
 cout<<"0"<<endl;
 else
 {
   if(v[k-1]-last_sum+1>=0&&v[k-1]-last_sum+1<=m)
   cout<<v[k-1]-last_sum+1<<endl;
   else
   cout<<"Impossible"<<endl;
 }
}

}

Blockquote

please help me @raghav_242439 @ashish_kaur