BUYING FEED nyist248
来源:互联网 发布:淘宝样式管理 编辑:程序博客网 时间:2024/06/05 04:28
BUYING FEED
- 描述
Farmer John needs to travel to town to pick up K (1 <= K <= 100)pounds of feed. Driving D miles with K pounds of feed in his truck costs D*K cents.
The county feed lot has N (1 <= N<= 100) stores (conveniently numbered 1..N) that sell feed. Each store is located on a segment of the X axis whose length is E (1 <= E <= 350). Store i is at location X_i (0 < X_i < E) on the number line and can sell John as much as F_i (1 <= F_i <= 100) pounds of feed at a cost of C_i (1 <= C_i <= 1,000,000) cents per pound.
Amazingly, a given point on the X axis might have more than one store.Farmer John starts at location 0 on this number line and can drive only in the positive direction, ultimately arriving at location E, with at least K pounds of feed. He can stop at any of the feed stores along the way and buy any amount of feed up to the the store's limit. What is the minimum amount Farmer John has to pay to buy and transport the K pounds of feed? Farmer John
knows there is a solution. Consider a sample where Farmer John needs two pounds of feed from three stores (locations: 1, 3, and 4) on a number line whose range is 0..5:
0 1 2 3 4 5
---------------------------------
1 1 1 Available pounds of feed
1 2 2 Cents per poundIt is best for John to buy one pound of feed from both the second and third stores. He must pay two cents to buy each pound of feed for a total cost of 4. When John travels from 3 to 4 he is moving 1 unit of length and he has 1 pound of feed so he must pay1*1 = 1 cents.
When John travels from 4 to 5 heis moving one unit and he has 2 pounds of feed so he must pay 1*2 = 2 cents. The total cost is 4+1+2 = 7 cents.
- 输入
- The first line of input contains a number c giving the number of cases that follow
There are multi test cases ending with EOF.
Each case starts with a line containing three space-separated integers: K, E, and N
Then N lines follow :every line contains three space-separated integers: Xi Fi Ci - 输出
- For each case,Output A single integer that is the minimum cost for FJ to buy and transport the feed
- 样例输入
12 5 3 3 1 24 1 21 1 1
- 样例输出
7
思路:
贪心。
#include <iostream>#include <algorithm>using namespace std;#define MAXN 101struct Node{int x;int feeds;int cent;}node[MAXN];bool cmp(Node a, Node b){return a.cent < b.cent;}void input(){int t, k, e, n;cin >> t;while (t--){cin >> k >> e >> n;for (int i = 0; i < n; i++){cin >> node[i].x >> node[i].feeds >> node[i].cent;node[i].cent += e - node[i].x;}sort(node, node + n, cmp);int ans = 0;for (int i = 0; i < n; i++){if (node[i].feeds <= k){ans += node[i].feeds * node[i].cent;k -= node[i].feeds;}else{ans += k * node[i].cent;break;}}cout << ans << endl;}}int main(){std::ios::sync_with_stdio(false);input();return 0;}
- BUYING FEED nyist248
- BUYING FEED
- BUYING FEED
- BUYING FEED
- NYOJ 248 BUYING FEED
- NYOJ 248 BUYING FEED
- NYOJ248-BUYING FEED
- NYOJ-248 BUYING FEED
- 题解 NYOJ248 BUYING FEED
- nyoj 248 BUYING FEED
- BUYING FEED(NYOJ248)
- NYOJ 248 BUYING FEED
- 第三届省赛题 BUYING FEED
- nyoj248 BUYING FEED
- BUYING FEED 典型的贪心
- BNUOJ 4151 Buying Feed II
- nyoj 248 BUYING FEED 【贪心】
- nyoj 323 BUYING FEED 贪心
- 最长公共子序列和最长递增子序列
- 关于字符串指针不可修改的问题
- jquery-mvc中ajax重复提交(click重复绑定)以及点击没反应问题
- C/C++资源
- ASP.NET跨页面传值技巧总结
- BUYING FEED nyist248
- hdu 2014 青年歌手大奖赛_评委会打分
- oracle基础---sql语句 ado 存储过程 总结
- 负载均衡策略(1) 随机调度
- @GeneratedValue
- java编程中写出好代码的建议
- OpenGL渲染管线
- POJ 2481 Cows(树状数组)
- Largest Rectangle in Histogram (直方图中最大面积) 【leetcode】