Minimize Sensitivity Score Difference

Problem Statement

Minimize Sensitivity Score Difference Problem Description You are developing a secure document storage system. Each document has a unique identifier and a sensitivity score. To maximize security, you need to distribute the documents across multiple servers such that the sum of sensitivity scores on each server is balanced. Use appropriate algorithmic concepts to store and manage document distributions. Given a list of documents with their sensitivity scores and the number of servers, distribute the documents such that the maximum difference in sensitivity scores between any two servers is minimized. Input Format The first line contains two space separated integer N, representing the number of documents and integer K, representing the number of servers. The next N lines contain the list of tuples, where each tuple contains two elements: An integer id representing the unique identifier of the document and, An integer sensitivity representing the sensitivity score of the document Output F