单词识别【北京理工大学】

题目链接

本题按字典序排

#include<bits/stdc++.h>
using namespace std;
bool cmp(pair<string,int> &a, pair<string,int> &b){
	if(a.second != b.second) return a.second > b.second;
	else return a.first < b.first;
}

int main(){
	string str,tmp;
	map<string, int> mp;
	while(getline(cin,str)){
		mp.clear();
		tmp.clear();
		for(int i=0;i<str.size();i++){
				if(str[i]==' '||str[i]==','||str[i]=='.'){
					if(tmp!="") mp[tmp]++;
					tmp="";
				}else tmp += tolower(str[i]);
		}
		for(auto it: mp){
			cout<<it.first<<":"<<it.second<<endl;
		}
	}
	
	return 0;
} 

map按照值排序

bool cmp(pair<string,int> &a, pair<string,int> &b){
	if(a.second != b.second) return a.second > b.second;
	else return a.first < b.first;
}
map<string, int> mp;

vector<pair<string,int> > v(mp.begin(), mp.end());
sort(v.begin(), v.end(), cmp);