编程介的小学生 2017-09-01 05:17 采纳率: 20.5%
浏览 732
已采纳

Auctions R Us

Having run into trouble with current online auctions and buyers that win auctions and then back out, you decide to open a new enterprise that has the bidders deposit funds before they may bid onany item. If they win an auction, the amount they bid is immediately (that second!) deducted from their account. (The problem of sellers that don't deliver the items will be left for another day.)

You must write a program to implement the rules of this auction. You will be auctioning off a number of items, each of which will have a reserve price that must be met. Each of your bidders will deposit funds with you, and you must match these funds with items they successfully bid for.You will write a program that tracks the auctions during a single day and outputs the results ofeach auction.

Auction Rules

You are guaranteed:

No two items will have the same end time.
No two bids will have the same bid time.
No price, bid, or account balance will be negative.
Bidder numbers and item numbers are unique within each category, but a bidder may have the same number as an item. Bidder and item numbers are not necessarily assigned sequentially.

An auction is won by the highest bid that:

arrives no later than the second the auction ends.
is greater than or equal to the minimum price for the item
has at least the bid amount remaining in the bidder's account at the instant the auction ends.

Input

There are 3 sections in the data file, describing the items available for bid, the registered bidders, and the bids made during the auction.

Items

A single line containing the number of items, i
i lines, one for each item of the form:

Item number is a non-negative integer, minimum price is specified to the penny (0.01), and auction end time is in 24 hour format of the form XX:YY:ZZ where XX is in hours from 00 to 23, YY is in minutes from 00 to 59, and ZZ is in seconds from 00 to 59.
Bidders

A single line with the number of bidders registered, j
j lines of bidder data of the form:

Where bidder number is a non-negative integer and account balance is specified to the penny (0.01).
Bids

A single line with the number of bids received, k
k lines of bid data of the form:

where all fields are formatted as described above.

Output

Output one line for each item being auctioned, in order of their auction finish time, listing

Item Bidder Price

If there is not a winning bid for an item, for that item output

Item Reserve not met.

Sample Input

2
1 5.00 05:06:27
2 25.00 15:30:11
2
11 37.37
22 55.55
3
1 11 60.00 04:03:01
2 11 26.00 00:18:03
2 22 27.00 09:03:05

Sample Output

Item 1 Reserve not met.
Item 2 Bidder 22 Price 27.00

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-09-16 15:52
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 运筹学排序问题中的在线排序
  • ¥15 关于docker部署flink集成hadoop的yarn,请教个问题 flink启动yarn-session.sh连不上hadoop,这个整了好几天一直不行,求帮忙看一下怎么解决
  • ¥30 求一段fortran代码用IVF编译运行的结果
  • ¥15 深度学习根据CNN网络模型,搭建BP模型并训练MNIST数据集
  • ¥15 C++ 头文件/宏冲突问题解决
  • ¥15 用comsol模拟大气湍流通过底部加热(温度不同)的腔体
  • ¥50 安卓adb backup备份子用户应用数据失败
  • ¥20 有人能用聚类分析帮我分析一下文本内容嘛
  • ¥30 python代码,帮调试,帮帮忙吧
  • ¥15 #MATLAB仿真#车辆换道路径规划