Painter problem

#1

here in your specified test case N=3 so how in the next line you can provide 5 inputs? i.e 1 2 3 4 5
so if you provide 1 2 3 4 5 as input then again N=5 and N is not greater than K once again

#2

Hello @yath17

The input is as follows:
N boards
K painters
T time (each painter takes this much amount of time to paint 1 unit of any board)
Length of N boards

Output:
Print the minimum it will take to paint all the boards if all the painters works in parallel.

Ex:-
2 2 5
1 10
Here
2 (Number of boards) = N
2 (Number of painters) = K
5 (Amount of time that any painter will take to paint 1 unit of board) = T
1 10 (Length of boards)

Lets say, painter 1 paints board 1 and painter 2 paints board 2
Then painter 1 will finish the work in 5 units of time
while painter 2 will finish the work in 50 units of time.

So both painters will complete their work in under 50 units of time, which is the minimum time required.

If painter 1 paints both board 1 and board 2
Then it will take 55 units of time

Minimum of 50 and 55 is 50
so output 50