我的Python3代码

n = int(input())
s = []
m = 0
ss = [chr(127)]*10005
book = [0]*n
for i in range(n):
    a = input()
    s.append(a)
t = input()
for i in range(n):
    m += len(s[i])
m //= n//2
s.sort()
a = 0
for i in range(n):
    if book[i] != 0:
        continue
    book[i] = 1
    for j in range(n):
        if book[j] != 0:
            continue
        if len(s[i])+len(s[j]) != m:
            continue
        s1 = s2 = ''
        s1 = s[i]+t+s[j]
        s2 = s[j]+t+s[i]
        ss[a] = min(s1,s2)
        a += 1
        book[j] = 1
        break
ss.sort()
for i in range(n//2):
    print(ss[i])