标记-----pat-L1-030一帮一

题目连接：https://www.patest.cn/contests/gplt/L1-030

AC代码如下

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<climits>


using namespace std;


int main()
{
int n,a[50],flag[50];//flag数组标记 
string b[50];
while(scanf("%d",&n) != EOF)
{
for(int i = 0; i < n; i++)
{
cin>>a[i];
cin>>b[i]; 
flag[i] = 0;
}
for(int i = 0; i < n/2; i++)
{
for(int j = n-1; j >= n/2; j--)
{
if(a[i] != a[j] && !flag[j])
{
cout<<b[i]<<" ";
cout<<b[j]<<endl;
flag[j] = 1;
break;
}
}
} 
} 
 return 0;
}