codersalman / Hacktoberfest-2022

This is a repository for anyone wishing to contribute to HacktoberFest 2022
https://hacktoberfest.com
MIT License
20 stars 78 forks source link

subtask problem #110

Closed Faiqa-Nasir closed 1 year ago

Faiqa-Nasir commented 1 year ago

Chef recently solved his first problem on CodeChef. The problem he solved has NN test cases. He gets a score for his submission according to the following rules:

If Chef’s code passes all the NN test cases, he gets 100100 points.

If Chef’s code does not pass all the test cases, but passes all the first M\;(M \lt N)M(M<N) test cases, he gets K\;(K \lt 100)K(K<100) points.

If the conditions 11 and 22 are not satisfied, Chef does not get any points (i.e his score remains at 00 points).

You are given a binary array A_1, A_2, \dots, A_NA 1 ​ ,A 2 ​ ,…,A N ​ of length NN, where A_i = 1A i ​ =1 denotes Chef's code passed the i^{th}i th test case, A_i = 0A i ​ =0 denotes otherwise. You are also given the two integers M, KM,K. Can you find how many points does Chef get?

Input Format First line will contain TT, number of testcases. Then the testcases follow. The first line of each test case contains three space-separated integers N, M, KN,M,K. The second line contains NN space-separated integer A_1, A_2,\dots, A_NA 1 ​ ,A 2 ​ ,…,A N ​ . Output Format For each testcase, output in a single line the score of Chef.