HDU 1070 - Select the cheapest product

来源：互联网发布：java接口与安卓对接编辑：程序博客网时间：2024/05/28 18:42

Select the cheapest product

-->>use <vector> to record what we got dynamically.
-->>sort by provide a customized method.

http://acm.hdu.edu.cn/showproblem.php?pid=1070

#include <iostream>#include <string>#include <algorithm>#include <vector>using namespace std;struct Milk {char name[110];int pay;int vol;double price;};bool cmp(const Milk &a, const Milk &b) {if(a.price != b.price)return a.price < b.price;elsereturn a.vol > b.vol;    // choose the smaller}int main(){int T;cin >> T;while(T --) {int N;vector <Milk> vec;Milk temp;cin >> N;for(int i = 0; i < N; ++ i) {cin >> temp.name >> temp.pay >> temp.vol;int d = 0;int t = temp.vol;while(t >= 200 && d <= 4) {d ++;t -= 200;}if(d) { // if this milk corresponds to what the problem requests, note it downtemp.price = temp.pay / d;    // calculate the price.vec.push_back(temp);}}sort(vec.begin(), vec.end(), cmp);cout << vec[0].name << endl;}return 0;}

0 0