Marriage is Stable HDU1522 稳定婚姻问题

#include<cstdio>
#include<string>
#include<map>
#include<iostream>
#include<cstring>
using namespace std;
#define N 20

map<string,int>mp_boy,mp_girl;
int girl[N][N],boy[N][N];//girl数组存放  第i个女对第j个男的好感度   boy数组存放第i个男的第j优先好感度为谁
int match_girl[N],match_boy[N];
string name_boy[N],name_girl[N];
int rank1[N];

int main()
{
    mp_boy.clear();mp_girl.clear();
    int n;
    while(scanf("%d",&n)==1)
    {
        string name,str;
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            cin>>name;
            mp_boy[name]=i;
            name_boy[i]=name;
            for(int j=1;j<=n;j++)
            {
                cin>>str;
                int t=mp_girl[str];
                if(!t)
                    mp_girl[str]=t=++cnt,name_girl[cnt]=str;
                boy[i][j]=t;
            }
        }
        for(int i=1;i<=n;i++)
        {
            cin>>name;
            for(int j=1;j<=n;j++)
            {
                cin>>str;
                int t=mp_boy[str];
                girl[ mp_girl[name] ][t]=n-j;
            }
        }
        memset(match_boy,0,sizeof match_boy);
        memset(match_girl,0,sizeof match_girl);
        memset(rank1,0,sizeof rank1);

        int flag=1;
        while(flag)
        {
            flag=0;
            for(int i=1;i<=n;i++)
            {
                if(!match_boy[i])
                {
                    int temp=boy[i][ rank1[i]++ ];
                    if(!match_girl[temp])
                        match_boy[i]=temp,match_girl[temp]=i;
                    else if( girl[temp][i]>girl[temp][ match_girl[temp] ]  )
                    {
                        match_boy[ match_girl[temp] ]=0;
                        match_boy[i]=temp;
                        match_girl[temp]=i;
                    }
                    flag=1;
                }
            }
        }
            for(int i=1;i<=n;i++)
             cout<<name_boy[i]<<" "<<name_girl[ match_boy[i] ]<<endl;
    }
}