ENTEXAM - Editorial

chinnanah · June 18, 2016, 3:57pm

if have now corrected that mistake, still it shows not working

cyberneo · June 28, 2016, 7:11pm

@tarun_174
He can.
The max marks, M is 1 to 10^9. But he can get 0.

Please upvote,I need karma to upvote or ask questions

vijju123 · April 3, 2017, 1:33am

Fixed the link.

monsij · December 31, 2017, 3:46pm

Got it finally

sonu_7101999 · August 7, 2019, 1:55pm

I appraoched the problem same as the editorial still getting wrong answer,do suggest test cases where my code is failing.
`#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;
typedef long double ld;

#define FOR(a,b) for(auto i=a;i<b;i++)
#define FAIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define test_cases int T;cin>>T;while(T–)

int main(){
FAIO

int N,K,E,M;
long long int temp,sum=0;
int seat;
long long int marks_of_Sergery = 0,marks_required_by_Sergery;
vector<long long int> Marks;
test_cases{
    cin>>N>>K>>E>>M;
    for(int i=0;i<N-1;i++)
    {
        for(int j=0;j<E;j++){
            cin>>temp;
            sum+=temp;
        }
        Marks.push_back(sum);sum=0;
    }
    for(int i=0;i<E-1;i++){cin>>temp;marks_of_Sergery+=temp;}
    
    sort(Marks.begin(),Marks.end(),greater<int>());
    seat=N-K-1;
    marks_required_by_Sergery=Marks[seat]+1-marks_of_Sergery;
   
    marks_required_by_Sergery=max(0LL,marks_required_by_Sergery);

    if(marks_required_by_Sergery>M){cout<<"Impossible"<<endl;continue;}
    cout<<marks_required_by_Sergery<<endl;

    //clear the variables for next input TestCase;
    Marks.clear();
    sum=0;marks_of_Sergery=0;marks_required_by_Sergery=0;
}

return 0;

}

/*

Autthor: SONUKUMARSAW
email: sonukumarsaw66@gmail.com
*/`

zair07 · September 10, 2019, 10:33am

I tried every test case and getting every answer correctly but still it’s showing wrong answer. My solution

manrajx · February 12, 2020, 6:28pm

not able to submit reported to bug team still no change

jpratik15 · March 27, 2020, 4:48pm

[quote=“kevinsogo, post:1, topic:12655”]
I have this very silly doubt ,what difference does 0LL do in the above program?
As soon as I changed 0 to 0LL,it worked completely fine.

anon93889075 · June 30, 2020, 9:52am

I have tried all the test cases but still getting wrong answer
`
import java.util.;
import java.lang.;
import java.io.*;

/* Name of the class has to be “Main” only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
try{
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t–!=0){
int n=sc.nextInt();
int k=sc.nextInt();
int e=sc.nextInt();
long m=sc.nextInt();
int studentsMarksSum[]=new int[n-1];
int sum=0;
int sergeySumOfMarks=0;
for(int i=0;i<n-1;i++){
for(int j=0;j<e;j++){
int m1=sc.nextInt();
if(m1<=m){
sum=sum+m1;
}
}
studentsMarksSum[i]=sum;
sum=0;
}
for(int i=0;i<studentsMarksSum.length-1;i++){
int sergeyMarks=sc.nextInt();
if(sergeyMarks<=m){
sergeySumOfMarks +=sergeyMarks;
}
}
int firstLargest=Integer.MIN_VALUE;
int secondLargest=Integer.MIN_VALUE;
for(int i=0;i<studentsMarksSum.length;i++){
if(studentsMarksSum[i]>firstLargest){
secondLargest=firstLargest;
firstLargest=studentsMarksSum[i];
}
else if(studentsMarksSum[i]>secondLargest){
secondLargest=studentsMarksSum[i];
}
}
if((secondLargest-sergeySumOfMarks+1 <=m) && !(secondLargest-sergeySumOfMarks+1<0) && !(sergeySumOfMarks>secondLargest)){
System.out.println(secondLargest-sergeySumOfMarks+1);
}
else if(sergeySumOfMarks>secondLargest){
System.out.println(0);
}
else{
System.out.println(“Impossible”);
}
}
}
catch(Exception e){
}
}
}
`

tiwary123 · September 20, 2020, 1:24pm

I am not getting what is the error in my code as my logic is almost the same as the editorialist

this is my code

Blockquote
#include<bits/stdc++.h>
using namespace std;

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[n-1][e];
  
  for(int i=0;i<n-1;i++)
  {
      for(int j=0;j<e;j++)
      {
        cin>>arr[i][j];   
      }
  }
  
  int sum=0;
  int a;
  for(int i=0;i<e-1;i++)
  {
      cin>>a;
      sum=sum+a;
  }
  
     int finalarr[n-1];
   
   int sum2=0;
   for(int i=0;i<n-1;i++)
   {
       sum2=0;
       for(int j=0;j<e;j++)
       {
           sum2=sum2+arr[i][j];
       }
       finalarr[i]=sum2;
       
   }
   
   
   
   sort(finalarr,finalarr+n-1,greater<int>());
     
    if(finalarr[k-1]-sum+1<=m&&finalarr[k-1]-sum+1>=0)
     cout<<finalarr[k-1]-sum+1<<endl;
     else
    if(finalarr[k-1]-sum+1<0)
     cout<<"0"<<endl;
    else
    cout<<"Impossible"<<endl;
}

}

@cubefreak777 @rohit272000 @rishup_nitdgp @shivam_og @rashmitha_p26 @vijju123

saurabh2225 · January 24, 2021, 8:13pm

Brother can you please help me. I don’t know that why my code is not getting accepted. It is showing as Wrong Answer, even the output is right.

#include
#include
using namespace std;

long long totals[10011];
int main(){
int T;
cin>>T;
for(int i = 0; i < T; i++){
int T_std, K, N_Exams, M_marks;
cin>>T_std>>K>>N_Exams>>M_marks;
for(int j = 0; j<T_std - 1; j++){
long long total = 0;
for(int l = 0; l<N_Exams; l++){
int score;
cin>>score;
total += score;
}
totals[j] = total;
}
long long tk = 0;
for(int l = 0; l<N_Exams - 1; l++){
long long score;
cin>>score;
tk += score;
}
//sort(totals.begin(), totals.end(), greater());
sort(totals,totals+T_std-1);
reverse(totals,totals+T_std-1);
if(totals[K-1] > tk){
int answer = totals[K-1] - tk + 1;
if(answer > M_marks){
cout<<“Impossible”<<endl;
}
else{
cout<<answer<<endl;
}
}
else{
cout<<0;
}

    }
return 0;

}

tej_as_2001 · July 29, 2021, 4:56pm

Brother can you please help me. I don’t know that why my code is not getting accepted. It is showing as Wrong Answer, even the output is right.

#–=— code starts
from functools import reduce# cook your dish here
t =int(input())
sol=[]
for tc in range(t):
(n,k,e,m)=map(int,input().split(’ '))
no_stude = n
maximal_enrolled = k
no_of_exams = e
max_score = m
t_scores = []

for i in range(no_stude - 1):
    a = list(map(int,input().split(' ')))
    total_scor = reduce(lambda x,y:x+y,a)
    t_scores.append(total_scor)
    t_scores.sort()
# print(t_scores,'t_scores')    
S_marks = list(map(int,input().split(' ')))
S_total_marks = reduce(lambda x,y:x+y,S_marks)
# print(S_total_marks,'S_total_marks')
# print((a[len(t_scores)-k]),'second last ')
marks_needed = (t_scores[len(t_scores)-k]+1)-S_total_marks

if marks_needed >max_score:
    sol.append('Impossible')
else:
    sol.append(marks_needed)

for r in sol:
print®

onedimesion · September 6, 2021, 6:03pm

any helpers in chat ???
cant find the test case this code will fail

total_marks = []
sum1 = 0
times = input()

for i in times:

n, k, e, m = map(int, input().split(' '))
for x in range(n):
    marks_ = input()
    marks_ = marks_.split()

    if x != (n - 1):
        for y in range(e):
            sum1 = sum1 + int(marks_[y])

        total_marks.append(sum1)
        sum1 = 0
        marks_.clear()
    else:
        for y in range(e-1):
            sum1 = sum1 + int(marks_[y])

        candidate = sum1
        sum1 = 0
        marks_.clear()

total_marks.sort()
if total_marks[k-1] < candidate:
    print('0')
elif (total_marks[k-1] - candidate + 1) <= m:
    print(total_marks[k-1] - candidate + 1)
elif (total_marks[k - 1] - candidate + 1) > m:
    print("Impossible")