用一个map就行了,开一个map<string,int>,然后就是map的基本操作了
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
void solve(){
int n;
cin>>n;
map<string,int>w;
for(int i=1;i<=n;i++){
int a;
cin>>a;
if(a==1){
string b;
int c;
cin>>b>>c;
if(w.count(b)){
auto j=w.find(b);
j->second=c;
}else w.insert({b,c});
cout<<"OK"<<endl;
}else if(a==2){
string b;
cin>>b;
if(w.count(b)){
auto j=w.find(b);
cout<<j->second<<endl;
}else cout<<"Not found"<<endl;
}else if(a==3){
string b;
cin>>b;
if(w.count(b)){
w.erase(b);
cout<<"Deleted successfully"<<endl;
}else cout<<"Not found"<<endl;
}else{
cout<<w.size()<<endl;
}
}
return ;
}
int main(){
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int _;
//cin>>_;
_=1;
while(_--){
solve();
}
return 0;
}