poj 2491 map 问题

#include<iostream>
#include<string>
#include<map>
#include<cstdlib>
using namespace std;
int main()
{
	map<string,string> s1;
	map<string,int> s2;
	string str1,str2,temp;
	char s[40];
	int n,m,i,j,k;
	cin>>n;
	for(i=0;i<n;i++)
	{
		s1.clear();
		s2.clear();
		cin>>m;
		getchar();
		for(j=0;j<m-1;j++)
		{
			
			gets(s);
			k=0;
			while(1)
			{
				if(s[k]==' ')
				{
					s[k]='\0';
					break;
				}
				k++;
			}
		    str1=s;
			str2=s+k+1;
			s1[str1]=str2;
			s2[str1]++;
			s2[str2]++;
		}
		map<string,int>:: iterator iter;    //;;容易忘
		for(iter=s2.begin();iter!=s2.end();iter++)
		{
			if(iter->second==1&&s1[iter->first].size())
				temp=iter->first;
		}
		cout<<"Scenario #"<<i+1<<":"<<endl;
		cout<<temp<<endl;
		for(j=0;j<m-1;j++)
		{
			cout<<s1[temp]<<endl;
			temp=s1[temp];
		}
		cout<<endl;
	}
	system("pause");
	return 0;
}