PAT 1121 Damn Single

“Damn Single (单身狗)” is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 50,000), the total number of couples. Then N lines of the couples follow, each gives a couple of ID’s which are 5-digit numbers (i.e. from 00000 to 99999). After the list of couples, there is a positive integer M (≤ 10,000) followed by M ID’s of the party guests. The numbers are separated by spaces. It is guaranteed that nobody is having bigamous marriage (重婚) or dangling with more than one companion.

Output Specification:
First print in a line the total number of lonely guests. Then in the next line, print their ID’s in increasing order. The numbers must be separated by exactly 1 space, and there must be no extra space at the end of the line.

题目大意：
在给的一些数里找出未配对的数并按升序排列。
思路：
用map<int,int>存放配对信息，再用一个exist[1000009]布尔数组存放本次存在的数，check每一个数把未配对的数放入set集合中。
但其实想想这个程序效率很低，但暂时没有思路去改进。
代码：

#include<iostream>
#include<map>
#include<set>
#include<string>
using namespace std;
bool exist[100009]={false};
map<int,int> m;
set<string> s;
void check(string d){
	if(!exist[m[stoi(d)]]) s.insert(d);
	return;
}
int main(){
	int n1,n2;
	cin>>n1;
	while(n1--){
		int c1,c2;
		cin>>c1>>c2;
		m[c1]=c2;m[c2]=c1;
	}
	cin>>n2;
	string data[n2];
	for(int i=0;i<n2;i++){
		cin>>data[i];
		exist[stoi(data[i])]=true;
	} 
	for(int i=0;i<n2;i++) check(data[i]);
	cout<<s.size()<<endl;
	for(auto it=s.begin();it!=s.end();it++){
		if(it!=s.begin()) printf(" ");
		cout<<*it;
	} 
	return 0;
}

最后学习了一种写法：
＂％０５ｄ＂：按宽度为５输出，右对齐，若不够五位，补０.

很多基础还是没打好，继续努力！