PAT1092 To Buy or Not to Buy （20 分）

最新推荐文章于 2023-06-07 14:07:31 发布

原创最新推荐文章于 2023-06-07 14:07:31 发布 · 332 阅读

0 ·

CC 4.0 BY-SA版权

PAT-A 专栏收录该内容

81 篇文章

订阅专栏

本题要求判断Eva是否能在商店购买到所需颜色的珠子串，并计算额外购买或缺失的数量。通过输入两个字符串，分别代表商店和Eva的珠子串，使用C++中的map数据结构来统计每种颜色珠子的数量，进而判断是否满足需求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1092 To Buy or Not to Buy （20 分）

Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is Yes, please tell her the number of extra beads she has to buy; or if the answer is No, please tell her the number of beads missing from the string.
For the sake of simplicity, let’s use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.
在这里插入图片描述

Input Specification:
Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.

Output Specification:
For each test case, print your answer in one line. If the answer is Yes, then also output the number of extra beads Eva has to buy; or if the answer is No, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.

Sample Input 1:

ppRYYGrrYBR2258
YrR8RrY

Sample Output 1:

Yes 8

Sample Input 2:

ppRYYGrrYB225
YrR8RrY

Sample Output 2:

No 2

解析

其实就是看第一个字符串中的字符能不能组成第二个字符串。

#include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
	string  input1, input2;
	cin >> input1 >> input2;
	map<char, int> Map;
	for (auto ch : input1) 
		Map[ch]++;
	for (auto ch : input2)
		Map[ch]--;
	int extra=0, miss = 0;
	for (auto x : Map) {
		if (x.second >= 0)
			extra += x.second;
		else
			miss -= x.second;
	}
	if (miss > 0)
		printf("No %d", miss);
	else 
		printf("Yes %d", extra);
}