CodeForces 16B Burglar and Matches (贪心)
来源:互联网 发布:淘宝贷款app 编辑:程序博客网 时间:2024/06/06 14:22
题意 一个窃贼到火柴仓库偷火柴 仓库有m个容器 第i个容器有a[i]个火柴盒 其中每个火柴盒中有b[i]根火柴 窃贼最大可以拿n个火柴盒 输入n m 然后m行a[i] b[i] 求窃贼最多能偷多少根火柴
很水的贪心 直接每次选当前火柴最多的盒子 n减去盒子数 直到n=0
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int M = 25; int a[M], b[M], c[M], n, m, ans; bool cmp (int i, int j) { return b[i] > b[j]; } int main() { scanf ("%d%d", &n, &m); for (int i = 1; i <= m; ++i) { c[i] = i; scanf ("%d%d", &a[i], &b[i]); } sort (c + 1, c + m + 1, cmp); ans = 0; for (int i = 1; i <= m; ++i) { if (n >= a[c[i]]) { n -= a[c[i]]; ans += a[c[i]] * b[c[i]]; } else { ans += n * b[c[i]]; break; } } printf ("%d\n", ans); return 0; }
A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are mcontainers, in the i-th container there are ai matchboxes, and each matchbox contains bi matches. All the matchboxes are of the same size. The burglar's rucksack can hold n matchboxes exactly. Your task is to find out the maximum amount of matches that a burglar can carry away. He has no time to rearrange matches in the matchboxes, that's why he just chooses not more than n matchboxes so that the total amount of matches in them is maximal.
The first line of the input contains integer n (1 ≤ n ≤ 2·108) and integer m (1 ≤ m ≤ 20). The i + 1-th line contains a pair of numbers ai and bi (1 ≤ ai ≤ 108, 1 ≤ bi ≤ 10). All the input numbers are integer.
Output the only number — answer to the problem.
7 35 102 53 6
62
3 31 32 23 1
7
- CodeForces 16B Burglar and Matches(贪心)
- CodeForces 16B Burglar and Matches (贪心)
- CodeForces 16B Burglar and Matches
- 16B. Burglar and Matches
- Codeforces 442B Andrey and Problem(贪心)
- Codeforces 596B Wilbur and Array 【贪心】
- CodeForces 596B Wilbur and Array 贪心
- codeforces#331-B. Wilbur and Array-贪心
- Codeforces 731 B. Coupons and Discounts【贪心】
- [codeforces] B - Anatoly and Cockroaches 贪心
- Codeforces 492B Vanya and Lanterns【贪心】
- CodeForces 740B - Alyona and flowers(贪心)
- Codeforces 755-B. PolandBall and Game(贪心)
- Codeforces 785B Anton and Classes(贪心)
- codeforces #311 B B. Pasha and Tea(贪心)
- Codeforces 387B George and Round(贪心)
- Codeforces 390B Inna, Dima and Song(贪心)
- Codeforces 415B Mashmokh and Tokens(贪心)
- 【我的问题】android通过XML实现按钮被按下的反馈效果
- cf 383D DP
- HDU4445
- Maven学习笔记(四):坐标与依赖
- android volume设置 代码分析
- CodeForces 16B Burglar and Matches (贪心)
- hive中order by,sort by, distribute by, cluster by作用以及用法
- 简单背包
- 魔方机器人之下位机编程---模拟PWM
- HDU--1231 : 最大连续子序列 (DP求连续子序列最大和)
- 面对就业我们是否还在徘徊那么你就看看这篇文章吧
- Java基础视频教程-银行业务调度系统
- linux下vim的配置
- 努力学英语——从背单词开始