PAT(BASIC)1039. 到底买不买(20)
2015-04-04 09:56
239 查看
#include<iostream> #include<map> #include<string> int main(void){ using namespace std; string str_solder,str_buyer; map<char,int> solder; map<char,int> buyer; cin>>str_solder>>str_buyer; for(auto c:str_solder) ++solder[c]; for(auto c:str_buyer) ++buyer[c]; int lack=0; for(auto p:buyer){ if(p.second>solder[p.first]) lack+=(p.second-solder[p.first]); } if(lack==0) cout<<"Yes "<<(str_solder.size()-str_buyer.size()); else cout<<"No "<<lack; system("pause"); }
相关文章推荐
- PAT(basic level) 1039 到底买不买(20)
- PAT Basic 1039. 到底买不买(20)(C语言实现)
- PAT (Basic Level) Practise (中文)1039. 到底买不买(20)
- PAT (Basic Level) Practise (中文)1039. 到底买不买(20)
- PAT BASIC LEVEL 1039. 到底买不买(20)
- PAT (Basic Level) Practise (中文)-1039. 到底买不买(20)
- PAT (Basic Level) Practise (中文)1039. 到底买不买(20) C语言
- 乙级 PAT 1039. 到底买不买(20)
- PAT-1039 到底买不买(20)(字符串的使用)
- 1039. 到底买不买(20) PAT乙级真题
- PAT (Basic Level) Practise:1039. 到底买不买
- PAT 乙级 1039. 到底买不买(20)
- 【PAT】1039. 到底买不买(20)
- PAT 1039. 到底买不买(20)
- PAT-1039. 到底买不买(20)
- C++ - PAT - 1039. 到底买不买(20)
- PAT 乙级 1039. 到底买不买(20)
- PAT1039 到底买不买(20)
- PAT (Basic Level)1039. 到底买不买
- PAT 1039. 到底买不买(20)