Techgig code gladiators 2020 solutions | Python Practice

                                Test-II Solution

Problem Statements

Beyblade World Championship 

Tyson is all prepared for the Beyblade World Championship. The tournament is team-based and each team can have N members. A player can fight against a single-player only. Team G-Revolution is all excited and pumped up as they have practiced a lot. Kenny, the mind of team G-Revolution, has created a database where he has the data about the power of other teams members and his own team members. The tournament is going to start in some time and Kenny moves to the cafeteria to have a snack before the competition.

The team G-Revolution is to fight in some time and they are tensed up as someone has kidnapped Kenny from the cafeteria. They have made a police complaint and the police are searching for Kenny. Luckily, they have found his device with all the data. The problem is, the data is present randomly and not in the order they have to fight the opponent. Team G-Revolution wants to win at any cost and for that, they need the order in which they have to fight optimally to win the maximum number of battles.

A player can win only when his/her Beyblade power is strictly greater than the opponent's Beyblade power.


Consider the team size is 3, N = 3

The 3 players of both the teams are shown with their Beyblade powers.

Team G-Revolution is presented in the order: Tyson, Max, Ray

Team, All Starz is presented in the order: Michael, Eddy, Steve

With the given arrangement, Team G-Revolution would be able to win only 1 fight. Team G-Revolution should be shuffled in an optimal manner as below:

Techgig , code gladiator,

The maximum number of fights Team G-Revolution can win is 2 when they are arranged optimally or fight in an optimal order.

Team G-Revolution needs help with the device. Tyson has heard about your skills and called you up to help them shuffle their positions in an order such that they would be able to win the maximum number of fights. Can you help Tyson and Team G-Revolution?

How to solve this problem

To solve this problem we want to analyze or understand the problem statements.

So, of all, we need to understand the question and solve this problem.
So, our first need to understand the question.
Get the input n the python programming.
And then try to solve the problem in a python programming language by apply logic.
Then print the output using the giving method.

Explanation of the problem statements

The problem said that there are two teams and we have to compete with this team with each other. And we have to given that the power of each of the power and have to fight with each other and that power is more then they win so we want to win. And our team is first so our task is to win the match from the opponent team.

Input Format

The first line of input consists of the number of test cases, T

The first line of each test case consists of the number of members each team can have, N.

The second line of each test case consists of N space-separated integers representing the power of Beyblades of Team G-Revolution members.

The third line of each test case consists of N space-separated integers representing the power of Beyblades of opponent team members.


1<= T <=100000
1<= N <=100000

0<= Power of Beyblade <= LLONG_MAX

Output Format

For each test case, print the maximum number of fights Team G-Revolution can win if they go to fight in an optimal manner.

How to solve this problem:

  • So, first, we make a line of code to take input from the user (Such as the number of the test case).

  • Now, make a variable named count and set as 0.

  • Then, we will make a result list that stores the result of the input.

  • Then we will iterate the while loop for checking the number of the test cases.

  • Then again, we will take the input of the number of players from the user.

  • Now the next step is to split the input.

  • Now we will reverse the input of a number of players and villian.


In Python3 and JAVA8

In python3:

def main():
    while a>0:
	for i in range(n):
		for j in range(p,n):
			if g[i]>x[j]:
# Made by Ankur Patel


public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(;
        int cases = Integer.parseInt(reader.readLine());
        while (cases > 0) {
            int count = 0;
            int numberOfMember = Integer.parseInt(reader.readLine()); // 5
            String[] firstTeam = reader.readLine().split(" ");
            String[] secondTeam = reader.readLine().split(" ");
            Integer[] firstTeamInt = Stream.of(firstTeam).mapToInt(Integer::parseInt).boxed().toArray(Integer[]::new);
            Integer[] secondTeamInt = Stream.of(secondTeam).mapToInt(Integer::parseInt).boxed().toArray(Integer[]::new);
            Arrays.sort(firstTeamInt, Collections.reverseOrder());
            Arrays.sort(secondTeamInt, Collections.reverseOrder());
            int point = 0;
            for (int i = 0; i < numberOfMember; i++) {
                for (int j = point; j < numberOfMember; j++) { // 0 1 4
                    if (firstTeamInt[i] > secondTeamInt[j]) {
                        point = j + 1;
        // Made by Ankur Patel

3 6 7 5 3 5 6 2 9 1 
2 7 0 9 3 6 0 6 2 6 

Next Post Previous Post
  • Farveen
    Farveen June 19, 2020 at 6:25 PM

    Hi Ankur,

    I also wrote python script with same logic but i did sort not reverse sort. My testcase got passed only for sample. Other testcases are failed. I dont know why it is failed. Because your script and my script both are same. Can you please tell how you passed this python script and do you also faced sample alone passed ever in your try.


    • Ankur Ranpariya
      Ankur Ranpariya June 20, 2020 at 9:14 AM

      I think in your script first while loop is missing. The first while loop is for the number of the test case. That's why your script is failed in the other test cases.Please check it and reply me.And if your script alread have a while loop then please share your code in comment or Email.

      Ankur Patel

Add Comment
comment url