Codeforces 1379 C Choosing flowers

更好的阅读体验

C. Choosing flowers

开启传送门

题目描述

Vladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly $n$ flowers.

Vladimir went to a flower shop, and he was amazed to see that there are $m$ types of flowers being sold there, and there is unlimited supply of flowers of each type. Vladimir wants to choose flowers to maximize the happiness of his wife. He knows that after receiving the first flower of the $i$-th type happiness of his wife increases by $a_i$ and after receiving each consecutive flower of this type her happiness increases by $b_i$. That is, if among the chosen flowers there are $x_i>0$ flowers of type $i$, his wife gets $a_i+(x_i-1)\ast b_i$ additional happiness (and if there are no flowers of type $i$, she gets nothing for this particular type).

Please help Vladimir to choose exactly $n$ flowers to maximize the total happiness of his wife.

Input

The first line contains the only integer $t(1\le t\le 10000)$, the number of test cases. It is followed by $t$ descriptions of the test cases.

Each test case description starts with two integers $n$ and $m$ ($1\le n\le 10^9,1\le m\le 100000$), the number of flowers Vladimir needs to choose and the number of types of available flowers.

The following $m$ lines describe the types of flowers: each line contains integers $a_i$ and $b_i$ ($0\le a_i,b_i\le 10^9$) for $i$-th available type of flowers.

The test cases are separated by a blank line. It is guaranteed that the sum of values $m$ among all test cases does not exceed $100000$.

Output

For each test case output a single integer: the maximum total happiness of Vladimir’s wife after choosing exactly $n$ flowers optimally.

Example

Input1

2

4 3

5 0

1 4

2 2

5 3

5 2

4 2

3 1

Output1

14

16

Note

In the first example case Vladimir can pick $1$ flower of the first type and $3$ flowers of the second type, in this case the total happiness equals $5+(1+2\cdot 4)=14$.

In the second example Vladimir can pick $2$ flowers of the first type, $2$ flowers of the second type, and $1$ flower of the third type, in this case the total happiness equals $(5+1\cdot 2)+(4+1\cdot 2)+3=16$.

题意

现在有 $m$ 种花，每种花都有无线朵，每朵花有两个价值，一个是 首次价值 $a_i$, 一个是其他价值 $b_i$。如果对于第 $i$ 种花，买了 $k$ 朵，那么价值为 $a_i+(k-1)\ast b_i$。问你如果恰好买 $n$朵花的最大价值。

分析

首先，我们假设所有的 $b_i$ 都是 $0$，那么我们有，我们只需要按照 $a_i$ 排序，选择 $n$ 朵价值最高的，就是答案。

其次，我们是不会选择多个 $b_i$ 的。这个也很好想，假设选了两个不同的 $b_i$ 和 $b_j$，不妨设 $b_i>b_j$，那么我显然可以把额度都用在 $b_i$ 上，这样价值更高，所以一定只会选择一个 $b_i$。

然后，一个显而易见的策略就是，我们优先选择几个比较大的 $a_i$，然后无脑枚举一个 $b_i$，剩下的额度都买这个 $b_i$。

可以证明，这个一定是个凸函数，所以三分可以得到这个极值。

#include<bits/stdc++.h>
using namespace std;
long long n, m;
pair<long long, long long> num[100010];
bool cmp(pair<long long,long long> a, pair<long long, long long> b) {
	if(a.first != b.first) return a.first>b.first;
	return a.second > b.second;
}
long long cal(int ind) {
	long long ret = 0;
	if(n<ind) return -1;
	for(int i = 1;i<=ind;i++) ret += num[i].first;
	long long ans = 0;
	for(int i = 1;i<=ind;i++) ans = max(ans, num[i].second*(n-ind));
	if(n>ind) for(int i = ind+1;i<=m;i++) ans = max(ans, num[i].second*(n-ind-1) + num[i].first);
	return ret + ans;
}
void solve() {
	cin>>n>>m;
	for(int i = 1;i<=m;i++) cin>>num[i].first>>num[i].second;
	sort(num+1, num+m+1, cmp);
	long long ans = 0;
	int l = 0, r = m;
	while(l+10<r) {
		int lmid = (l*2+r) / 3;
		int rmid = (l+r*2) / 3;
		if(cal(lmid) < cal(rmid)) l = lmid;
		else r = rmid;
	}
	for(int i = l;i<=r;i++) ans = max(ans, cal(i));
	cout<<ans<<endl;
}
int main() {
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}