system idle process是什么进程，system idle占用cpu高怎么回事

今天小编为大家分享Windows系统下载、Windows系统教程、windows相关应用程序的文章，希望能够帮助到大家！

You have a computing cluster with a total of k computing nodes, labelled from 0 to k−1. The cluster can handle multiple requests at the same time, but each node can process at most one request at the same time.

The rules for request assignment to computing nodes are as follows. Assume the i-th (i starts from 0) request arrives. If all nodes are occupied, the request is discarded (not processed at all). If the (i%k)-th node is available, it will process the request. Otherwise, the request will check the availability of the next node at (i +1)%k, (i +2)%k, and so on, until it finds an idle node.

Given a set of requests with their arrival time and the processing time, your task is to find the busiest computing nodes. A node that belongs to the busiest nodes when no other nodes serve more requests than it does.

Input

The first line includes k and n, representing the size of the cluster and the number of requests.

Each of the next n lines includes two positive integers, representingthe arrival time and the processing time of a request.

The input data satisfy that 1 ≤ k,n ≤ 100,000, and 1 ≤ arrival_time,processing_time ≤ 1,000,000,000.

The requests are given in non-decreasing order of arrival time.

Output

Print the labels of all the busiest nodes in lexicographic order, separated by spaces.

wWw.Xtw.com.Cn系统网专业应用软件下载教程，免费windows10系统,win11,办公软件,OA办公系统,OA软件,办公自动化软件,开源系统,移动办公软件等信息，解决一体化的办公方案。