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 to the problem. Make sure both test cases return correct answers.Output FormatOutput consists of either a single integer n, where n is the maximum number of problems that can be solved within the given time limit T, or "This exam is impossible!" (without quotes) if no problem can be solved within the given time limit T.Sample Input 05 293 87 97 26 67 4Sample Output 04Explanation 0You can finish the first 4 problems, which will take 3+7+7+6=23 seconds. Attempting the fifth problem will result in 23+7=30 seconds, which is greater than T=29.Sample Input 16 56 67 109 49 1110 1010 0Sample Output 1This exam is impossible!Explanation 1None of the problems have t_i <= T=5, so it is impossible to finish even a single problem.The actual codedef solve(n,t,problems): # compute and return answer heredef main(): n,t = list(map(int,input().strip().split(' '))) problems = [tuple(map(int,input().strip().split(" "))) for i in range(n)] print(solve(n,t,problems))if __name__ == "__main__": main() Exams can be fairly challenging, especially exams with lots of problems! Coupled with a strict time limit, it canbe fairly intimidating and stressful to even think about solving said problems. A lot of time and effort is spentdeciding which problem to tackle first. Easy problems take a lot less time to solve than average problems, butare often worth less points. Difficult problems take the most time, but are most of the time worth the mostpoints. It's almost like you are playing a game when you strategize for an exam; would you go for the easierchallenges but are worth less or go for the mother lodes you aren't even sure you can solve.Ah, quite the dilemma indeed.Given an exam of N problems with a time limit of T, your task is to figure out the maximum number of examitems you can complete within the time limit, given the amount of time t; each problem would take for you tosolve them and the amount of points p, you can get from solving each respective problem. Some reallydifficult problems may as well be unsolvable; these problems will have a t; value of -1.If you cannot solve a single problem within the time limit, then you are to say "This exam is impossible!"Input FormatThe first line of the input contains two space-separated integers N and T, indicating the number of problemsin the exam and the exam's time limit (in minutes, rounded to the nearest minutes).N lines follow, each containing a pair of space-separated integers t; and pi, where t; is the number ofminutes, rounded to the nearest minute, needed to complete the ith problem and p; is the number of pointsthe ith problem is worth.Note that if a problem cannot be solved, it's t; value would be - 1.Constraints1≤N ≤ 1050 ≤ T ≤ 10⁹0 ≤ti, Pi≤ 104 V t₁ = −1

Algorithm: The algorithm to solve the problem can be described as follows: Read the input values:…

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 to the problem. Make sure both test cases return correct answers. Output Format Output consists of either a single integer n, where n is the maximum number of problems that can be solved within the given time limit T, or "This exam is impossible!" (without quotes) if no problem can be solved within the given time limit T. Sample Input 0 5 29 3 8 7 9 7 2 6 6 7 4 Sample Output 0 4 Explanation 0 You can finish the first 4 problems, which will take 3+7+7+6=23 seconds. Attempting the fifth problem will result in 23+7=30 seconds, which is greater than T=29. Sample Input 1 6 5 6 6 7 10 9 4 9 11 10 10 10 0 Sample Output 1 This exam is impossible! Explanation 1 None of the problems have t_i <= T=5, so it is impossible to finish even a single problem. The actual code def solve(n,t,problems): # compute and return answer here def main(): n,t = list(map(int,input().strip().split(' '))) problems = [tuple(map(int,input().strip().split(" "))) for i in range(n)] print(solve(n,t,problems)) if name == "main":

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

80%

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 to the problem. Make sure both test cases return correct answers.

Output Format
Output consists of either a single integer n, where n is the maximum number of problems that can be solved within the given time limit T, or "This exam is impossible!" (without quotes) if no problem can be solved within the given time limit T.

Sample Input 0
5 29
3 8
7 9
7 2
6 6
7 4

Sample Output 0
4

Explanation 0
You can finish the first 4 problems, which will take 3+7+7+6=23 seconds. Attempting the fifth problem will result in 23+7=30 seconds, which is greater than T=29.

Sample Input 1
6 5
6 6
7 10
9 4
9 11
10 10
10 0

Sample Output 1
This exam is impossible!

Explanation 1
None of the problems have t_i <= T=5, so it is impossible to finish even a single problem.

The actual code

def solve(n,t,problems):
# compute and return answer here

def main():
n,t = list(map(int,input().strip().split(' ')))
problems = [tuple(map(int,input().strip().split(" "))) for i in range(n)]
print(solve(n,t,problems))

if __name__ == "__main__":
main()