Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply greedy algorithm or divide and conquer in the problem. Make sure all test cases return expected outputs. Also please provide screenshot of the code actually displaying the outputs with the respective inputs. The actual incomplete code"""Solves a test case.Parameters:n : int - number of cards availablek : int - number of cards to include in Jason's deckcards : array-like - string list of shape (n,2). Each element has two elements: the first is a string containing the color (either "red" or "blue"). The second is a string containing the power of the card.Returns:r : int - number of red cards addedtp : int - total power of cards in your deck"""def solve(n,k,cards): # TODO passn,k = list(map(int,input().strip().split(' ')))cards = [list(input().strip().split(' ')) for i in range(n)]red, tp = solve(n,k,cards)print(f"{red} {tp}") Jason is on the playtesting team of a new trading card game called Logic: The Unsundering. The game is in theearly prototype stages. As a result, only two major card colors have been implemented: red and blue. Red isfocused primarily on offense and resource maintenance. Blue is mainly focused on defense and boardcontrol.Each card belongs to one of the two colors and has a power value P₁. Unfortunately, the balancing isimperfect; red cards are more powerful than blue cards. This is quite unfortunate, but Jason intends to makethe most out of this. If he can build a deck that dominates all other decks, then Jason can show the gamedesigners this crucial flaw in the game design.Jason has N cards, each with a color C; and power P₁. He wants to build the strongest deck possible. Out ofall the possible decks, one deck is deemed stronger than another if it has more red cards. If two decks havethe same amount of red cards, the deck with a higher total P across all the cards is more powerful. Jason hasto build a deck containing K cards. Can you help Jason build the strongest deck?Input FormatInput begins with a line containing two space-separated integers N and K, indicating the number of cardsavailable and the number of cards allowed in a deck respectively.N lines follow, each containing two space-separated values C and P; that describe one card's color andpower respectively. C is a string with a value of either "red" or "blue" (without quotes). P; is an integer.Constraints1≤K≤N≤3.105C₂ € {red, blue}0 ≤ P ≤ 10⁹Output FormatOutput contains two space-separated integers R and TP. R is the number of red cards in Jason's deck. TP isthe total P₁ of the cards in the deck. Sample Input 053red 1red 1blue 5blue 7blue 9Sample Output 02 11Sample Input 163blue 13blue 8blue 2blue 6red 6blue 2Sample Output 11 27Sample Input 274red 4blue 6red 3red 12red 8blue 1red 3Sample Output 24 27

Algorithm: Parse the input values n and k from the first line of input. Parse the n cards and store…

Answered: Information is present in the…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply greedy algorithm or divide and conquer in the problem. Make sure all test cases return expected outputs. Also please provide screenshot of the code actually displaying the outputs with the respective inputs.

The actual incomplete code

"""
Solves a test case.

Parameters:
n : int - number of cards available
k : int - number of cards to include in Jason's deck
cards : array-like - string list of shape (n,2). Each element has two elements:
the first is a string containing the color (either "red" or "blue"). The second
is a string containing the power of the card.

Returns:
r : int - number of red cards added
tp : int - total power of cards in your deck
"""
def solve(n,k,cards):
# TODO
pass

n,k = list(map(int,input().strip().split(' ')))
cards = [list(input().strip().split(' ')) for i in range(n)]

red, tp = solve(n,k,cards)

print(f"{red} {tp}")