Meeting Room

Problem Statement

Meeting Room Problem Description Given N groups of people who want to have a meeting in the only meeting room in the office. Each group has people[i] people, who want to start the meeting at the starting[i] time and end it at the ending[i] time (both inclusive). No two groups can use the meeting room at the same time. If group i does not get the meeting room, then all the people[i] people cannot meet. Calculate the minimum number of people that cannot meet if the meeting room is optimally assigned to groups. Note: Group i and j can get the meeting room one after the other if and only if end[i] < start[j] . Function Description Complete the function solve . This function takes the following 4 parameters and returns the required answer: N : Represents the number of groups people[] : Represents the number of people in each group starting[] : Represents the starting time of their meetings ending[] : Represents the ending time of their meetings Input Format for Custom Testing Note: Use t