摘要： #include <stdio.h>#include <string.h>#include <stdlib.h>#include <set>#include <iostream>using namespace std;int main( ){ set<int>q; int N,i,t; while (scanf("%d",&N), N) { q.clear( ); for (i = 0; i < N; i++) { scanf("%d",&t); if(!q.i 阅读全文

摘要： #include <stdio.h>#include <string.h>#include <queue>#include <stdlib.h>#include <iostream>using namespace std;struct node1 { int k; int p; bool operator < ( const node1 &A ) const { return p < A.p; }}ND1;priority_queue<node1>q1;void add( ){ scanf(" 阅读全文

摘要： Double QueueTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4628Accepted: 2130DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies. 阅读全文

摘要： #include <iostream>#include <string.h>#include <stdlib.h>#include <algorithm>#include <set>#include <stdio.h>#include <functional>using namespace std;int main( ){ set<string,greater<string> >T; int i; char str[10]; //字符串插入 for(i = 0; i < 4; i+ 阅读全文

摘要： #include <iostream>#include <string.h>#include <stdlib.h>#include <algorithm>#include <set>#include <stdio.h>using namespace std;struct compare{ bool operator ( ) (string s1, string s2) { return s1 > s2; }};int main( ){ set<string,compare>T; int i; char s 阅读全文