第三届河南省acm省赛 BUYING FEED
来源:互联网 发布:nike淘宝旗舰店真假 编辑:程序博客网 时间:2024/05/22 18:37
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
- 样例输入
1
2 5 3
3 1 2
4 1 2
1 1 1
- 样例输出
7
- 来源
- 第三届河南省程序设计大赛
- 上传者
- ACM_赵铭浩
题意:
有n个地点有东西
下面是每个地点包含的价格和个数,和哪个地点;
求出到拿m个物品到终点的 最小价格;
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node
{
int cost;
int num;
}e[4000];
int K, E, N;
int X[400], F[400], C[400];
int cmp(node a, node b)
{
return a.cost < b.cost;
}
int main()
{
int n;
scanf("%d", &n);
while(n--)
{
scanf("%d %d %d", &K, &E, &N);
for(int i = 1; i <= N; i++)
{
scanf("%d %d %d", &X[i], &F[i], &C[i]);
e[i].cost = C[i] + E - X[i];//计算从这个点买一个到终点所用的价钱。
e[i].num = F[i];//记录这个物品的数量。
}
sort(e + 1, e + 1 + N, cmp);
/*for(int i = 1; i <= N; i++)
{
printf("%d %d\n", e[i].cost, e[i].num);
}*/
long long sum = 0, num = 0;
for(int i = 1; i <= N; i++)//贪心
{
for(int j = 1; j <= e[i].num; j++)
{
sum += e[i].cost;
num++;
if(num == K)
break;
}
if(num == K)
break;
}
printf("%lld\n", sum);
}
return 0;
}
- 第三届河南省acm省赛 BUYING FEED
- 第三届河南ACM省赛(BUYING FEED)
- nyoj 248 BUYING FEED 第三届河南省赛
- NYOJ-248-BUYING FEED(第三届河南省程序设计大赛E题(贪心))
- 第三届省赛题 BUYING FEED
- 第三届河南省acm省赛 房间安排
- 第三届河南省acm省赛 素数判定
- 河南省第三届acm省赛 AMAZING AUCTION
- 第三届河南省acm省赛 网络的可靠性
- 第三届河南省acm省赛 聪明的kk
- BUYING FEED
- BUYING FEED
- BUYING FEED
- 河南省第三届ACM程序设计大赛题解
- new 第三届 BUYING FEED (贪心)(当时被题目吓到了,还以为是搜索)
- (精)河南省第三届acm(房间安排)
- (精)河南省第三届acm(AMAZING AUCTION)
- NYOJ 248 BUYING FEED
- STL源码剖析heap
- centos7+php+nginx
- Linux操作系统安装MetaQ
- Swift学习笔记一:语言特性
- StringUtils用法+StringUtils详细介绍
- 第三届河南省acm省赛 BUYING FEED
- iOS百度地图-BMK标注&覆盖物
- 165. Compare Version Numbers
- Linux-15-启动vmware无法加载安装linux系统的故障解决(L003-29)
- 运行应用程序时使Windows系统不休眠
- 单例模式的实现方式
- 解决RHEL6 vncserver 启动 could not open default font 'fixed'错误.
- iOS开发遍历集合(NSArray,NSDictionary、NSSet)方法总结
- iOS、mac开源项目及库汇总