计蒜客 - 131 学生成绩查找系统

https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-131

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<unordered_map>
using namespace std;
int main()
{
	int s;
	string op,na;
	unordered_map<string,int> q;
	while(cin>>op)
	{
		if(op=="insert")
		{
			cin>>na>>s;
			q[na]=s;
		}
		else if(op=="find")
		{
			cin>>na;
			if(q.find(na)!=q.end())
				cout<<q[na]<<"\n";
			else
				cout<<"-1\n";
		}
		else if(op=="end")
			break;
	}
	
	return 0;
}