Submission #1199712

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199712		ofoz	Topical (NOI23_topical)	Pypy 3	12 / 100	1098 ms	283840 KiB

Main

from sys import stdout, setrecursionlimit
from math import ceil, floor, sqrt, comb
from collections import deque

def nOne(n: int, k: int):
    grid = []
    for _ in range(n): grid.append(list(map(int, input().split(" "))))
    ben = list(map(int, input().split(" ")))
    grid.sort()
    if sum(grid[0]) == 0:
        print(1)
    else:
        print(0)

def kOne(n: int, k: int):
    cur = 0
    grid = []
    for _ in range(n): grid.append(list(map(int, input().split(" "))))
    ben = []
    for _ in range(n): ben.append(list(map(int, input().split(" "))))

    pairs = []
    for i in range(n): pairs.append((grid[i][0], ben[i][0]))
    pairs.sort()
    pairs.reverse()
    cur = 0
    res = 0
    # print(pairs)
    while pairs and cur >= pairs[-1][0]:
        cur += pairs[-1][1]
        pairs.pop()
        res += 1
    print(res)
    

def solve():
    n, k = map(int, input().split(" "))
    if n == 1: nOne(n, k)
    elif k == 1: kOne(n, k)
    


solve()
 

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 43%)

=======

• Subtask 1: 12 / 12
• Subtask 2: 0 / 28
• Subtask 3: 0 / 21
• Subtask 4: 0 / 39