P2983 [USACO10FEB]购买巧克力Chocolate Buying
题目描述
Bessie and the herd love chocolate so Farmer John is buying them some.
The Bovine Chocolate Store features N (1 <= N <= 100,000) kinds of chocolate in essentially unlimited quantities. Each type i of chocolate has price P_i (1 <= P_i <= 10^18) per piece and there are C_i (1 <= C_i <= 10^18) cows that want that type of chocolate.
Farmer John has a budget of B (1 <= B <= 10^18) that he can spend on chocolates for the cows. What is the maximum number of cows that he can satisfy? All cows only want one type of chocolate, and will be satisfied only by that type.
Consider an example where FJ has 50 to spend on 5 different types of chocolate. A total of eleven cows have various chocolate preferences:
Chocolate_Type Per_Chocolate_Cost Cows_preferring_this_type 1 5 3
2 1 1
3 10 4
4 7 2
5 60 1
Obviously, FJ can't purchase chocolate type 5, since he doesn't have enough money. Even if it cost only 50, it's a counterproductive purchase since only one cow would be satisfied.
Looking at the chocolates start at the less expensive ones, he can * purchase 1 chocolate of type #2 for 1 x 1 leaving 50- 1=49, then * purchase 3 chocolate of type #1 for 3 x 5 leaving 49-15=34, then * purchase 2 chocolate of type #4 for 2 x 7 leaving 34-14=20, then * purchase 2 chocolate of type #3 for 2 x 10 leaving 20-20= 0.
He would thus satisfy 1 + 3 + 2 + 2 = 8 cows.
贝西和其他奶牛们都喜欢巧克力,所以约翰准备买一些送给她们。奶牛巧克力专卖店里
有N种巧克力,每种巧克力的数量都是无限多的。每头奶牛只喜欢一种巧克力,调查显示,
有Ci头奶牛喜欢第i种巧克力,这种巧克力的售价是P。
约翰手上有B元预算,怎样用这些钱让尽量多的奶牛高兴呢?
输入输出格式
输入格式:
* Line 1: Two space separated integers: N and B
* Lines 2..N+1: Line i contains two space separated integers defining chocolate type i: P_i and C_i
输出格式:
* Line 1: A single integer that is the maximum number of cows that Farmer John can satisfy
输入输出样例
- 5 50
- 5 3
- 1 1
- 10 4
- 7 2
- 60 1
- 8
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- #define inf 2147483647
- const ll INF = 0x3f3f3f3f3f3f3f3fll;
- #define ri register int
- template <class T> inline T min(T a, T b, T c)
- {
- return min(min(a, b), c);
- }
- template <class T> inline T max(T a, T b, T c)
- {
- return max(max(a, b), c);
- }
- template <class T> inline T min(T a, T b, T c, T d)
- {
- return min(min(a, b), min(c, d));
- }
- template <class T> inline T max(T a, T b, T c, T d)
- {
- return max(max(a, b), max(c, d));
- }
- #define scanf1(x) scanf("%d", &x)
- #define scanf2(x, y) scanf("%d%d", &x, &y)
- #define scanf3(x, y, z) scanf("%d%d%d", &x, &y, &z)
- #define scanf4(x, y, z, X) scanf("%d%d%d%d", &x, &y, &z, &X)
- #define pi acos(-1)
- #define me(x, y) memset(x, y, sizeof(x));
- #define For(i, a, b) for (int i = a; i <= b; i++)
- #define FFor(i, a, b) for (int i = a; i >= b; i--)
- #define bug printf("***********\n");
- #define mp make_pair
- #define pb push_back
- const int maxn = ;
- // name*******************************
- ll n,b;
- ll ans=;
- struct pp{
- ll c,p;
- }a[maxn];
- bool cmp(pp a,pp b){
- return a.p<b.p;
- }
- // function******************************
- //***************************************
- int main()
- {
- // ios::sync_with_stdio(0);
- // cin.tie(0);
- // freopen("test.txt", "r", stdin);
- // freopen("outout.txt","w",stdout);
- cin>>n>>b;
- For(i,,n)
- {
- cin>>a[i].p>>a[i].c;
- }
- sort(a+,a++n,cmp);
- For(i,,n)
- {
- ll t=b/a[i].p;
- if(t>a[i].c)
- {
- b-=a[i].p*a[i].c;
- ans+=a[i].c;
- }
- else
- {
- ans+=t;
- break;
- }
- // cout<<i<<":"<<ans<<" "<<b<<endl;
- }
- cout<<ans;
- return ;
- }
P2983 [USACO10FEB]购买巧克力Chocolate Buying的更多相关文章
- 洛谷——P2983 [USACO10FEB]购买巧克力Chocolate Buying
P2983 [USACO10FEB]购买巧克力Chocolate Buying 题目描述 Bessie and the herd love chocolate so Farmer John is bu ...
- 洛谷 P2983 [USACO10FEB]购买巧克力Chocolate Buying 题解
P2983 [USACO10FEB]购买巧克力Chocolate Buying 题目描述 Bessie and the herd love chocolate so Farmer John is bu ...
- 洛谷 P2983 [USACO10FEB]购买巧克力Chocolate Buying
购买巧克力Chocolate Buying 乍一看以为是背包,然后交了一个感觉没错的背包上去. #include <iostream> #include <cstdio> #i ...
- 洛谷P2983 [USACO10FEB]购买巧克力Chocolate Buying
题目描述 Bessie and the herd love chocolate so Farmer John is buying them some. The Bovine Chocolate Sto ...
- 【洛谷】P2983 [USACO10FEB]购买巧克力Chocolate Buying(贪心)
题目描述 Bessie and the herd love chocolate so Farmer John is buying them some. The Bovine Chocolate Sto ...
- 洛谷—— P2983 [USACO10FEB]购买巧克力Chocolate Buying
https://www.luogu.org/problem/show?pid=2983 题目描述 Bessie and the herd love chocolate so Farmer John i ...
- [USACO10FEB]购买巧克力Chocolate Buying
题目描述 Bessie and the herd love chocolate so Farmer John is buying them some. The Bovine Chocolate Sto ...
- [USACO10FEB]购买巧克力Chocolate Buying 【假背包真贪心】 By cellur925
题目传送门 继续dp刷题计划,看到这道题,第一眼感觉不就是显然的完全背包嘛.把背包打完要开始填充数组大小的时候成为了mengbier,发现数据极大,达到了1e18.显然这不是一道平凡的背包题目. 于是 ...
- [luoguP2983] [USACO10FEB]购买巧克力Chocolate Buying(贪心)
传送门 按价格排序后贪心 ——代码 #include <cstdio> #include <iostream> #include <algorithm> int n ...
随机推荐
- 【PyQt5 学习记录】009:批量创建组件并查找
这里需要在创建组件时使用 setObjectName() 为其添加 objectName 属性,再通过 findChild() 或者 findChildren() 函数来查找. 举个栗子,批量创建10 ...
- Csv读写类
<?php /** * CSV 文件读写类 * * 示例: $header = array('name' => '名字', 'age' =>'年龄', 'idcard' => ...
- oracel存储过程编写 以及plsql存储过程的debug
1.语法: create or replace procedure messagebackup_createTable //此处存储过程名称不能超过30个字符 as tableName ...
- 将ArcGIS Server的JSON转化为SHP文件
# -*- coding: utf-8 -*- # -------------------------------------------------------------------------- ...
- Flutter: 图解 ListView 的多种绑定方式
小菜昨天刚学习了一下底部状态栏 BottomNavigationBar 的基本使用方法,今天学习一下 ListView 的基本用法. 小菜觉得 Flutter 中 ListView ...
- Spring Boot -01- 快速入门篇(图文教程)
Spring Boot -01- 快速入门篇(图文教程) 今天开始不断整理 Spring Boot 2.0 版本学习笔记,大家可以在博客看到我的笔记,然后大家想看视频课程也可以到[慕课网]手机 app ...
- 记一次es和mq的netty冲突
1.今天在服务里面加了 es 6.4的 依赖包后,在预发布测试时候出现了下列的问题 看了 半天,最后发现是 es的 jar包 和 mq的 netty包 有冲突.然后去idea的 jar包依赖里面查 ...
- Ssh 证书验证 续篇
今天下午正好有外面的人要登录服务器,想了想,普通用户密码就是不想给,然后我就这样做了. useradd alex ---创建账户和密码 passwd alex mkdir /home/alex/.ss ...
- Oracle EBS 查询物料报错
- eclipse中如何添加tomcat插件
本篇简短的介绍了如何安装tomcat插件,因为不eclipse中不安装插件就没有tomcat图标,也就无法正常关闭服务器而只能terminate.废话不多说,直接进入主题: 1.首先下载一个tomca ...