Codeforces 1379 C Choosing flowers

2024-05-18 16:26:57

更好的阅读体验

C. Choosing flowers

开启传送门

题目描述

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

Vladimir went to a flower shop, and he was amazed to see that there are m m 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 i i-th type happiness of his wife increases by a i a_i ai and after receiving each consecutive flower of this type her happiness increases by b i b_i bi. That is, if among the chosen flowers there are x i > 0 x_i>0 xi>0 flowers of type i i i, his wife gets a i + ( x i − 1 ) ∗ b i a_i+(x_i-1)*b_i ai+(xi−1)∗bi additional happiness (and if there are no flowers of type i i i, she gets nothing for this particular type).

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

Input

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

Each test case description starts with two integers n n n and

Codeforces 1379 C Choosing flowers相关推荐

codeforces1379C Choosing flowers
https://codeforces.com/contest/1379/problem/C 按a拍个序,然后枚举每种花只多拿这一种剩下的大于bi的aj的必须拿,因为可以通过少拿一个bi来换一个更大 ...
CodeForces-1379C Choosing flowers
原题链接: https://vjudge.net/problem/CodeForces-1379C AC代码: #include <algorithm> #include <cmat ...
【CodeForces - 219D 】Choosing Capital for Treeland （树形dp）
题干: The country Treeland consists of n cities, some pairs of them are connected with unidirectional ...
CF1379C Choosing flowers
试着找出一个比较靠谱的思路先,重点在于物品买完第一次后会变化价格,之后都不会再变了,贪心地,如果我们重复地购买了一件物品,那么很显然我们只会重复购买一件物品多次,但这个物品可能不是 m a x ( b ...
Codeforces Round #657 (Div. 2)
A. Acacius and String 爆零!太菜了,下来终于把A题代码调AC了 #define IO ios::sync_with_stdio(false);cin.tie();cout.tie ...
C——Flowers
Problem Description As you know, Gardon trid hard for his love-letter, and now he's spending too muc ...
I - Watering Flowers CodeForces - 617C
I - Watering Flowers CodeForces - 617C int -2-31 ~ 231-1 == 2e9 longlong -2-63 ~ 263-1 == 9e18 有两种方法 ...
codeforces 794E Choosing Carrot
目录 codeforces 794E Choosing Carrot 题意题解 Code codeforces 794E Choosing Carrot 题目传送门题意给出一个长度为\(n\)的 ...
Codeforces - Choosing Capital for Treeland
题目链接:Codeforces - Choosing Capital for Treeland 显然,如果确定首都之后,我们可以O(n)计算出这个点的答案. 然后这个东西可以换根吗?显然是可以的.换根 ...
Codeforces 1088E Ehab and a component choosing problem（树形DP）
Codeforces 1088E Ehab and a component choosing problem(树形DP) 题意给一棵树,要求从中选一些联通分量,使得平均联通分量重量总和最大.如果有多 ...

最新文章

热门文章