Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add: description. Finishing Mar '22!

This commit is contained in:
Lam Haoyin 2022-04-01 00:11:01 +08:00
parent 4b25b11fcf
commit 0ccea4d27b
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
cpp/2203/220330-CN.cpp
View File

@ -3,6 +3,17 @@
#include <queue>
#include <iostream>
/**
* 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<int> busiestServers(int k, const std::vector<int>& arrival, const std::vector<int>& load) {