最大报销额问题

问题描述

实验室经常要报销一定额度的发票，Sao 负责这项工作。允许报销的发票类型包括买图

书（A 类）、文具（B 类）、差旅（C 类），要求每张发票的总额不得超过1000 元，每张发票

上，单项物品的价值不得超过600 元。

数据输入

测试输入包含若干测试用例。每个测试用例的第1行包含两个正数Q 和N，其中Q 是

给定的报销额度，N（<=30）是发票张数。随后是N 行输入，每行的格式为：

m Type_1:price_1 Type_2:price_2 ... Type_m:price_m

其中正整数m 是这张发票上所开物品的件数，Type_i 和price_i 是第i 项物品的种类和

价值。物品种类用一个大写英文字母表示。当N 为0时，全部输入结束，相应的结果不要输

出。-The maximum reimbursement issues

Problem Descr iption

Laboratories often reimbursed a certain amount of the invoice, Sao responsible for this work. Allow reimbursement invoice type including buying FIG.

Book (A class), stationery (Class B), the total amount of travel (Class C), the requirements of each invoice shall not be more than 1000 yuan, each invoice

The value of the individual items may not be more than 600 yuan.

data input

Test input contains several test cases. Each row of the first test case contains two positive numbers Q and N, wherein Q is

Given the reimbursement amount, N (<= 30) is the invoice number of sheets. Followed by N-line input, the format of each line is:

m Type_1: price_1 Type_2: price_2 ... Type_m: price_m

Wherein m is a positive integer on this invoice open items in quantity, Type_i and price_i is kind items and item i

value. Categories of items with a capital letters. When N is 0, all the input end of the corresponding results do not lose

Out.