1800. 不做最后一个！
摘要
Title: 1800. 不做最后一个！
Tag: 模拟
Memory Limit: 64 MB
Time Limit: 1000 ms
Powered by:NEFU AB-IN
1800. 不做最后一个！
-
题意
见原题
-
思路
根据题意模拟即可，注意只有一头奶牛时，答案就是它自己
-
代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34'''
Author: NEFU AB-IN
Date: 2022-04-04 21:56:57
FilePath: \ACM\Acwing\1800.py
LastEditTime: 2022-04-04 21:59:03
'''
from collections import Counter
INF = int(2e9)
d = Counter()
n = int(input())
for i in range(n):
s, x = input().split()
d[s] += int(x)
minn = INF
for key in d.keys():
minn = min(minn, d[key])
ans = INF
cnt = 0
for key in d.keys():
if d[key] > minn and ans >= d[key]:
if ans == d[key]:
cnt += 1
else:
cnt = 1
ans = d[key]
res = key
if ans == INF or cnt > 1:
print("Tie")
else:
print(res)