【错解】秦皇岛CCPC2020 D - Exam Results

最新推荐文章于 2022-06-27 01:12:01 发布

_CL0v3r

最新推荐文章于 2022-06-27 01:12:01 发布

阅读量189

点赞数

本文链接：https://blog.csdn.net/Norikage/article/details/115089090

版权

我的错解

def plu(maxp):
    res = 0
    for i in range(n):
        if high[i] <= maxp and high[i] > (maxp * p / 100):
            res += 1
    return res


for _ in range(int(input())):
    n, p = map(int, input().split())
    high = []
    low = []
    for k in range(n):
        a, b = map(int, input().split())
        high.append(a)
        low.append(b)
    maxp = max(low)
    pas = maxp * (p / 100)
    max_num = 0
    for i in low:
        if i >= pas:
            max_num += 1
    big = set()
    for i in range(n):
        if high[i] <= maxp and low[i] < pas:
            max_num += 1
        elif high[i] > maxp:
            big.add(high[i])
    big = sorted(list(big))
    for i in big:
        if plu(i) >= max_num:
            max_num = plu(i)
        else:
            break
    print('Case #'+str(_+1)+':', max_num)