Job for bounties 2 problem

please check what’s wrong with my logic https://ide.codingblocks.com/s/125789 https://hack.codingblocks.com/app/contests/969/p/963

which question are solving?
jobs of bounties :
https://hack.codingblocks.com/app/contests/140/p/731

please upload your question with correct content also

Mike is given N jobs and each job i is characterized by duration[i] (time taken to complete ith job), reward[i] (bounties he will get on finishing ith job) and deadline[i] (the time upto which ith job must be completed if it is to be done). He has T time and can do at most one job at a time. Now, he has to choose jobs maximizing the number of bounties he can get after T time units.

Input Format
The first line contains two integers, T and n, separated by space.
The next line contains N integers, separated by spaces, ith integer representing reward[i].
The next line contains N integers, separated by spaces, ith integer representing duration[i].
The next line contains N integers, separated by spaces, ith integer representing deadline[i].

Constraints
1 <= N <= 100 1 <= T,duration[i],reward[i],deadline[i] <= 1000

Output Format
Print maximum number of bounties Mike can get after T time units.

Sample Input
20 5
4 3 2 5 4
7 6 4 6 6
9 13 12 13 20
Sample Output
13

it is job for bounties 2


i am not get any code on this id please send you code again

@Saurabh2 sir please now check the code

@Saurabh2 probably you missed my question