Submission #72574811

---

Source Code Expand

import sys,bisect
from heapq import heappop, heappush
from collections import deque, Counter, defaultdict
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

N = ii()
S = [input() for _ in range(N)]
S = [(len(S[i]), S[i]) for i in range(N)]
S.sort()
ans = []
for i in reversed(range(N)):
    ans.append(S[i][1][0].upper())
print("".join(ans))

Submission Info

Judge Result