本文共 3065 字,大约阅读时间需要 10 分钟。
15Add lcy 1Add lyd 19Find 11Find 13Add zxs 10
Case #1:12lydWAIT...2
/* G++过了 C++编译错误 #include#include #include using namespace std;const int N=1000+10;struct Node{ string name; int id,val;}node[N],tmp;int len;bool cmp(Node a,Node b){ if(a.val==b.val) return a.id =f) return i; } return -1;}int main(){ int i,t,now=1,f,n,id; string c; cin>>t; while(t--){ len=0; id=1; cin>>n; cout<<"Case #"< <<":"< >c; if(c[0]=='A'){ cin>>node[len].name; cin>>node[len].val; node[len].id=id++; len++; cout< < >f; int re=find(f); if(re!=-1){ cout< < #include #include #include using namespace std;const int N=1000+10;struct Node{ char name[20]; int id,val;}node[N],tmp;int len;bool cmp(Node a,Node b){ if(a.val==b.val) return a.id =f) return i; } return -1;}int main(){ int i,t,now=1,f,n,id; char c[10]; scanf("%d",&t); while(t--){ len=0; id=1; scanf("%d",&n); printf("Case #%d:\n",now++); while(n--){ scanf("%s",c); if(c[0]=='A'){ scanf("%s%d",node[len].name,&node[len].val); node[len].id=id++; len++; printf("%d\n",len); } else{ scanf("%d",&f); int re=find(f); if(re!=-1){ printf("%s\n",node[re].name); node[re].id=node[len-1].id; node[re].val=node[len-1].val; for(i=0;node[len-1].name[i]!='\0';i++) node[re].name[i]=node[len-1].name[i]; node[re].name[i]='\0'; len--; } else printf("WAIT...\n"); } /* for(i=0;i #include #include
#include using namespace std;struct node{ string name; int grade; int time; node(string s,int a,int b):name(s),grade(a),time(b){} friend bool operator<(const node& a,const node& b) { if(a.grade!=b.grade) return a.grade =b.grade; }};int main(){ int cas,n,num; cin>>cas; string op,name; int time; for(int c=1;c<=cas;c++) { cin>>n;printf("Case #%d:\n",c); list li; time=1; for(int i=0;i >op; if(op[0]=='A') { cin>>name>>num; li.push_back(node(name,num,i)); li.sort(); cout< < >num; list ::iterator iter=find(li.begin(),li.end(),node("",num,0)); if(iter!=li.end()) { cout< name<
转载地址:http://afmvi.baihongyu.com/