From 0ccea4d27bfccc578dbd01f4e8539f4c05df0e2f Mon Sep 17 00:00:00 2001 From: Lam Haoyin Date: Fri, 1 Apr 2022 00:11:01 +0800 Subject: [PATCH] add: description. Finishing Mar '22! --- cpp/2203/220330-CN.cpp | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/cpp/2203/220330-CN.cpp b/cpp/2203/220330-CN.cpp index 9e63577..3312ef5 100644 --- a/cpp/2203/220330-CN.cpp +++ b/cpp/2203/220330-CN.cpp @@ -3,6 +3,17 @@ #include #include +/** + * 1606. Find Servers That Handled Most Number of Requests + * You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but cannot handle more than one request at a time. The requests are assigned to servers according to a specific algorithm: + * The ith (0-indexed) request arrives. + * If all servers are busy, the request is dropped (not handled at all). + * If the (i % k)th server is available, assign the request to that server. + * Otherwise, assign the request to the next available server (wrapping around the list of servers and starting from 0 if necessary). For example, if the ith server is busy, try to assign the request to the (i+1)th server, then the (i+2)th server, and so on. + * You are given a strictly increasing array arrival of positive integers, where arrival[i] represents the arrival time of the ith request, and another array load, where load[i] represents the load of the ith request (the time it takes to complete). Your goal is to find the busiest server(s). A server is considered busiest if it handled the most number of requests successfully among all the servers. + * Return a list containing the IDs (0-indexed) of the busiest server(s). You may return the IDs in any order. + */ + class Solution { public: static std::vector busiestServers(int k, const std::vector& arrival, const std::vector& load) {