PAT甲级1016

这个题从昨晚就开始做，但是离开实验室的时候仍然只过了0、3测试点

题目原文

1016 Phone Bills (25 point(s))

  A long-distance telephone company charges its customers by the following rules:
  Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. When a customer starts connecting a long-distance call, the time will be recorded, and so will be the time when the customer hangs up the phone. Every calendar month, a bill is sent to the customer for each minute called (at a rate determined by the time of day). Your job is to prepare the bills for each month, given a set of phone call records.

Input Specification:
  Each input file contains one test case. Each case has two parts: the rate structure, and the phone call records.
  The rate structure consists of a line with 24 non-negative integers denoting the toll (cents/minute) from 00:00 - 01:00, the toll from 01:00 - 02:00, and so on for each hour in the day.
  The next line contains a positive number N (≤1000), followed by N lines of records. Each phone call record consists of the name of the customer (string of up to 20 characters without space), the time and date (mm:dd:hh:mm), and the word on-line or off-line.
  For each test case, all dates will be within a single month. Each on-line record is paired with the chronologically next record for the same customer provided it is an off-line record. Any on-line records that are not paired with an off-line record are ignored, as are off-line records not paired with an on-line record. It is guaranteed that at least one call is well paired in the input. You may assume that no two records for the same customer have the same time. Times are recorded using a 24-hour clock.

Output Specification:
  For each test case, you must print a phone bill for each customer.
  Bills must be printed in alphabetical order of customers’ names. For each customer, first print in a line the name of the customer and the month of the bill in the format shown by the sample. Then for each time period of a call, print in one line the beginning and ending time and date (dd:hh:mm), the lasting time (in minute) and the charge of the call. The calls must be listed in chronological order. Finally, print the total charge for the month in the format shown by the sample.

Sample Input:

10 10 10 10 10 10 20 20 20 15 15 15 15 15 15 15 20 30 20 15 15 10 10 10
10
CYLL 01:01:06:01 on-line
CYLL 01:28:16:05 off-line
CYJJ 01:01:07:00 off-line
CYLL 01:01:08:03 off-line
CYJJ 01:01:05:59 on-line
aaa 01:01:01:03 on-line
aaa 01:02:00:01 on-line
CYLL 01:28:15:41 on-line
aaa 01:05:02:24 on-line
aaa 01:04:23:59 off-line

Sample Output:

CYJJ 01
01:05:59 01:07:00 61 $12.10
Total amount: $12.10
CYLL 01
01:06:01 01:08:03 122 $24.40
28:15:41 28:16:05 24 $3.85
Total amount: $28.25
aaa 01
02:00:01 04:23:59 4318 $638.80
Total amount: $638.80

题目大意

  是要求算出某人某月的话费账单，首先题目给出一天24小时不同的费率，单位是美＄～～～＄分/分钟。再给出通话起止时间(mm-dd-hh-mm)，但不一定匹配，题目同时保证至少有一个是匹配的，且时间不会重复。输出时必须按照名字序，时间序输出。
　　注意：如果当月未产生花费，则不输出客户信息

解题思路

  对于本题可以采用嵌套map来存储输入数据，且自动排序。
随后对每位用户遍历其通话记录找到若干对相邻的通话记录(on-line, off-line)，计算产生的花费(利用compute函数)及通话分钟数。不同客户，不用月份之间要输出当月总花费。将这些信息加入至vector< string> 中，最后直接打印结果

代码

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
//本题关键在于如果某人某月无费用产生，则不能输出该用户信息
int tolls[24] = {
    0 };
int compute(string time1, string time2, int& minutes) {
   
	int d1 = stoi(time1.substr(3, 2