CodeForces_1379C Choosing flowers(贪心)

最新推荐文章于 2021-08-02 14:59:27 发布

sigh_

最新推荐文章于 2021-08-02 14:59:27 发布

阅读量449

点赞数

分类专栏：贪心文章标签：贪心算法

本文链接：https://blog.csdn.net/sigh_/article/details/107491389

版权

贪心专栏收录该内容

15 篇文章 1 订阅

订阅专栏

本文探讨了一个有趣的数学问题：如何通过优化送花策略来最大化幸福感。在一个假想的情景中，有多种类型的花可供选择，每种花第一次赠送时会带来不同的欣赏值，而后续赠送同一类型花时欣赏值会有所变化。文章提出了一种算法，通过对花的欣赏值进行排序和二分查找，以确定最优的送花组合，从而实现总欣赏值的最大化。

摘要由CSDN通过智能技术生成

Choosing flowers

time limit per test：1 seconds memory limit per test：512 megabytes

Problem Description

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)⋅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 \leq t \leq 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≤n≤10^9$ , $1 \leq m \leq 100000$ ), the number of flowers Vladimir needs to choose and the number of types of available flowers.

Output

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

Sample Input

2
4 3
5 0
1 4
2 2

5 3
5 2
4 2
3 1

Sample Output

14
16

题意

花店共有m种花，每种花送第一支时有 $a_i$ 的欣赏值，重复送时则有 $b_i$ 的欣赏度，花店每种花的数量是无限的。共想送n支花，求欣赏值的最大值。

题解

对于 $b_i$ 的部分，在送的若干种花中，选择 $b_i$ 最大的即可。
枚举 $b_i$ ，先假设只卖第 $i$ 种花，则和为 $a_i + (n-1)*b_i$ 。需要让欣赏值最大，若存在其他的花的 $a_j > b_i(j!=i)$ ，则少买一只第 $i$ 种花，买一只第 $j$ 朵花即可。可以考虑对所有种花的 $a$ 值排序，二分快速找出所有大于 $b_i$ 即可。注意需要保留第 $i$ 种的第一支，以及最多找 $n - 1$ 个大于 $b_i$ 的其余花种。

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#include<iterator>
#define dbg(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define eps 1e-6
   
using namespace std;
typedef long long LL;  
typedef pair<int, int> P;
const int maxn = 100100;
const int mod = 998244353;
struct node{
    int a, b;
}p[maxn];
int a[maxn];
LL sum[maxn];
bool cmp(node a, node b);

int main()
{
    int t, n, m, i, j, k;
    LL ans;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d %d", &n, &m);
        for(i=1;i<=m;i++)
            scanf("%d %d", &p[i].a, &p[i].b);
        sort(p+1, p+m+1, cmp);
        sum[0] = 0;
        for(i=1;i<=m;i++){
            a[i] = p[i].a;
            sum[i] = sum[i-1]+a[i];
        }
        a[0] = 0;
        ans = 0;
        for(i=1;i<=m;i++){
            int pos = max(lower_bound(a+1, a+1+m, p[i].b)-a, m-(n-1)+1);
            int num = n-1-(m-pos+1);
            LL s = p[i].a+1LL*num*p[i].b+sum[m]-sum[pos-1];
            if(pos<=m && p[i].a >= a[pos]){
                s -= p[i].a;
                s += max(p[i].b, a[pos-1]);
            }
            ans = max(ans, s);
        }
        printf("%I64d\n", ans);
    }
    return 0;
}

bool cmp(node a, node b)
{
    return a.a < b.a;
}