AtCoder Beginner Contest 418(补题) C

C题：

C - Flush

Time Limit: 2 sec / Memory Limit: 1024 MiB

Score : 350 points

Problem Statement

On the poker table, there are tea bags of N different flavors. The flavors are numbered from 1 through N, and there are Ai​ tea bags of flavor i (1≤i≤N).

You will play a game using these tea bags. The game has a parameter called difficulty between 1 and A1​+⋯+AN​, inclusive. A game of difficulty b proceeds as follows:

1. You declare an integer x. Here, it must satisfy b≤x≤A1​+⋯+AN​.
2. The dealer chooses exactly x tea bags from among those on the table and gives them to you.
3. You check the flavors of the x tea bags you received, and choose b tea bags from them.
4. If all b tea bags you chose are of the same flavor, you win. Otherwise, you lose.

The dealer will do their best to make you lose.

You are given Q queries, so answer each of them. The j-th query is as follows:

• For a game of difficulty Bj​, report the minimum integer x you must declare at the start to guarantee a win. If it is impossible to win, report −1 instead.

Constraints

• 1≤N≤3×105
• 1≤Q≤3×105
• 1≤Ai​≤106 (1≤i≤N)
• 1≤Bj​≤min(106,A1​+⋯+AN​) (1≤j≤Q)
• All input values are integers.

Input

The input is given from Standard Input in the following format:

N Q
A1​ ⋯ AN​
B1​
⋮
BQ​

Output

Print Q lines.

The j-th line (1≤j≤Q) should contain the answer to the j-th query.

Sample Input 1

Copy

4 5
4 1 8 4
1
8
5
2
10

Sample Output 1

Copy

1
17
14
5
-1

For the 1-st query, if you declare x=1, then no matter which 1 bag the dealer chooses, you can satisfy the winning condition by choosing appropriate 1 bag among them. Since you cannot choose an integer x less than 1, the answer is 1.

For the 2-nd query, if you declare x=17, then no matter which 17 bags the dealer chooses, you can satisfy the winning condition by choosing appropriate 8 bags among them. Conversely, if x<17, the dealer can choose bags to prevent your victory. Thus, the answer is 17.

For the 3-rd query, if you declare x=14, then no matter which 14 bags the dealer chooses, you can satisfy the winning condition by choosing appropriate 5 bags among them. Conversely, if x<14, the dealer can choose bags to prevent your victory. Thus, the answer is 14.

For the 4-th query, if you declare x=5, then no matter which 5 bags the dealer chooses, you can satisfy the winning condition by choosing appropriate 2 bags among them. Conversely, if x<5, the dealer can choose bags to prevent your victory. Thus, the answer is 5.

For the 5-th query, no matter what x you declare, the dealer can choose bags to prevent your victory. Thus, print −1.

Sample Input 2

Copy

5 3
13 13 13 13 2
5
12
13

Sample Output 2

Copy

19
47
51

翻译：

C - Flush 

时间限制：2 秒 / 内存限制：1024 MiB

N Q
A1​ ⋯ AN​
B1​
⋮
BQ​

4 5
4 1 8 4
1
8
5
2
10

1
17
14
5
-1

5 3
13 13 13 13 2
5
12
13

19
47
51

#include<iostream>
#include<algorithm>
using namespace std;
#define int long long
const int N = 3e5 + 5;
int q, n, a[N], sm[N];
signed main()
{
	cin >> n >> q;
	for (int i = 1;i <= n;++i)
	{
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 1;i <= n;++i)
	{
		sm[i] = sm[i - 1] + a[i];//前缀和
	}
	while (q--)
	{
		int b, ans=0;
		cin >> b;
		//找到大于等于b-1的元素地址，再减去首地址，得到坐标索引
		int p = lower_bound(a + 1, a + 1 + n, b - 1)-a;
		ans += sm[p - 1] + (n - p + 1) * (b - 1) + 1;
		if (ans > sm[n])//满足条件的x比茶包总数还大，不合规
			ans = -1;
		cout << ans << endl;
	}
	return 0;
}