Algorithm Programming question

Programming language: Java

With your help Jack managed to keep his sanity by enjoying different meals each day, but now the troubled family is facing another challenge! Jack and Wendy often argue which show to watch on the big TV screen in Overlook Hotel. In order to avoid fighting over such trivial matters (and causing Jack to go insane), they bought a fancy recording device. The device has k different tapes, so it is capable of recording k different shows simultaneously. By programming this device they can specify which show should be recorded on which tape. Each show is recorded in its entirety, and when a programmed TV show stops being recorded on a particular tape, the device is immediately ready to start recording another show on that tape. Jack and Wendy wonder how many TV shows they can record during their stay at Overlook Hotel. You are given a schedule of TV shows for the remainder of their stay. Help Jack and Wendy find out the maximum number of shows they can record. Input There is one test case in a single input. The first line contains two integers n and k (1