HDU 5190-Go to movies

本博客介绍了一个利用贪心算法解决学生团体购票最小成本的问题。通过输入学生人数和影院提供的团购方案,程序帮助选择最经济的观影方案。案例分析了如何计算最少花费,适合初学者理解贪心算法的应用。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Go to movies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 259    Accepted Submission(s): 152


Problem Description
Winter holiday is coming!As the monitor, LeLe plans to go to the movies.
Because the winter holiday tickets are pretty expensive, LeLe decideds to try group-buying.
 

Input
There are multiple test cases, about 20 cases. The first line of input contains two integers n,m(1n,m100)n indicates the number of the students. mindicates how many cinemas have offered group-buying.

For the m lines,each line contains two integers ai,bi(1ai,bi100), indicating the choices of the group buying cinemas offered which means you can use biyuan to buy ai tickets in this cinema.
 

Output
For each case, please help LeLe **choose a cinema** which costs the least money. Output the total money LeLe should pay.
 

Sample Input
3 2 2 2 3 5
 

Sample Output
4
Hint
LeLe can buy four tickets with four yuan in cinema 1.
 

小结:

        贪心的水题....没什么需要注意的

以下是AC代码:

#include<stdio.h>
#include<string.h>
int main()
{
    int n,m,a,b,min;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        min=99999999;
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d",&a,&b);
            int temp=n%a?(n/a+1):(n/a);
            min=temp*b<min?temp*b:min;
        }
        printf("%d\n",min);
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值