Company: Amazon_5Dec
Difficulty: medium
Minimum Project Completion Time Problem Description A team of n developers at Amazon are assigned n projects to be completed. The time taken by the i th developer to write one program is represented by the array element time[i] , and the number of programs in the j th project is represented by the array element programs[j] . Each of the n developers is assigned one project such that each project is assigned to exactly one developer. If a developer i is assigned project j , then the developer will take time[i] * programs[j] units of time to complete the project. The time taken to complete all the n projects is the longest time it takes for a developer to complete their assigned project. Before assigning the projects, the team leader can organize at most k workshops. In each workshop, the following will happen: The team leader chooses any one developer x , who will attend the workshop. After the workshop, the time taken by the chosen developer to write one program will decrease by one, i