UVA 10420 List of Conquests
#include<iostream>
#include<string>
#include<map>
#include<cstdio>
using namespace std;
int main()
{
int n,i;
string name;
map<string,int> sal;
map<string,int>::iterator p1;
cin>>n;
cin.ignore();
for(i=0;i<n;i++)
{
cin>>name;
cin.ignore();
cin.sync();
p1=sal.find(name);
if(p1==sal.end())
sal.insert(make_pair(name,1));
else
sal[name]++;
}
for(p1=sal.begin();p1!=sal.end();p1++)
cout<<p1->first<<' '<<p1->second<<endl;
return 0;
}
为啥老WA呢,明明很对了