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. Each test case consist of an integer N in first line denoting the number of jobs and the next line consist of Job id, Deadline and the Profit associated to that Job.

**Output:**

Output the number of jobs done and the maximum profit.

**Constraints:**

1 <= T <= 100

1 <= N <= 100

1 <= Deadline <= 100

1 <= Profit <= 500

**Example:**

**Input:**

2

4

1 4 20 2 1 10 3 1 40 4 1 30

5

1 2 100 2 1 19 3 2 27 4 1 25 5 1 15

**Output:**

2 60

2 127

**Explanation:
Testcase 1:** 2 jobs can be done with maximum profit of 60.

Author: Shubham Chaudhary gfg

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

preparecodinginterview_dot_com | 190 |

__murugan__ | 173 |

manvimahajan20 | 140 |

xiaoyan_yunche | 139 |

ShameekAgarwal | 116 |

preparecodinginterview_dot_com | 190 |

__murugan__ | 173 |

manvimahajan20 | 166 |

SoumyaKaushik | 146 |

arpit_anshuman | 140 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.