Medium Accuracy: 42.91% Submissions: 21879 Points: 4

Given a set of N jobs where each job i has a deadline and profit associated to it. Each job takes 1 unit of time to complete and only one job can be scheduled at a time. We earn the profit if and only if the job is completed by its deadline. The task is to find the maximum profit and the number of jobs done.

Input:
The first line of input contains an integer T denoting the number of test cases. In each test case, first line consists of an integer N denoting the number of jobs. Second line will be of the format A_{1}, B_{1}, C_{1}, A_{2}, B_{2}, C_{2}..... A_{N}, B_{N}, C_{N}, where A_{i}, B_{i} and C_{i }denote the ID, deadline and profit from the ith job respectively.

Output:
Output the number of jobs done and the maximum profit seperated by a space in a different line for each test case.

Explanation:
Test Case 1: You can do job 3 followed by the job 1. The overall profit = 40 + 20 = 60 Test Case 2: You can do job 1 followed by the job 3. The overall profit = 100 + 27 = 127