NYOJ 248
来源:互联网 发布:动态分配二维数组 编辑:程序博客网 时间:2024/05/16 10:42
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
第一行输入一个数C数据的组数;
第二行输入三个数K E N;
接下来的N行,每一行包含三个整数Xi Fi Ci;
输出:对于每一个例子输出一个整数,表示John需要花费的最小的钱数;
大致思想:求出每个商店(每一点)每买一磅食物需要的价钱,价钱中包括从这点运到终点需要的运费
#include<bits/stdc++.h>using namespace std;struct node{ int pay; int get;}w[1001];bool cmp(node x,node y){ if(x.pay<y.pay) return true; return false;}int main(){ int t; scanf("%d",&t); while(t--) { int k,e,n,num,prize,sum; scanf("%d%d%d",&k,&e,&n); for(int i=0;i<n;i++) { scanf("%d%d%d",&num,&w[i].get,&prize); w[i].pay=(e-num)+prize; } sort(w,w+n,cmp); sum=0; for(int i=0;i<n;i++) { if(w[i].get>=k) { sum=sum+k*w[i].pay; break; } else { sum=sum+w[i].pay*w[i].get; k=k-w[i].get; } } printf("%d\n",sum); } return 0;}
- NYOJ 248
- NYOJ 248 BUYING FEED
- NYOJ 248 BUYING FEED
- NYOJ-248 BUYING FEED
- nyoj 248 BUYING FEED
- NYOJ 248 BUYING FEED
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- NYOJ
- c++ socket 异步编程
- [BZOJ4353]Play with tree(树链剖分+线段树)
- 我如何从一个本科双非报考帝都985最后调剂到帝都221的故事
- 【正一专栏】从人民的名义看失败的婚姻关系
- 【正一专栏】一直的梦想——我的读书记
- NYOJ 248
- CentOS 7 源码编译mysql5.7.11 ,如果在阿里云内存不足编译失败处理方法
- Javascript面向对象(八)——Class
- tiny6410的MMU的配置于使用
- 用户登入记住密码案例
- python新式类和经典类的区别
- Mybatis总结(5)---Mybatis输入输出映射
- NYOJ 247 SPFA算法
- jquery的Post方法$.post()