#include<iostream>
#include<stack>
#include<string>
#include<cmath>
#include<map>
#include<algorithm>
#include<sstream>
#include<set>
#include<queue>
using namespace std;
struct all{
int a;
string str;
bool operator<(const all& b) const
{
return str<b.str;
}
};
int main()
{
set<all> my_set;
all a = {6,"zyh"};
my_set.insert(a);
all b = {2,"ayh"};
my_set.insert(b);
all c= {4,"qwyh"};
my_set.insert(c);
if(my_set.find(a)==my_set.end())
cout<<"can not find"<<endl;
else
cout<<"find"<<endl;
if(my_set.count(a)==0)
cout<<"can not find"<<endl;
else
cout<<"find"<<endl;
for(set<all>::iterator it= my_set.begin();it!=my_set.end();it++)
cout<<(*it ).str<<endl;
return 0 ;
}