Submission #5,980

2023-10-09 08:43:05

python3

Accepted 30/30

128ms

37436 KiB

from sys import stdin, stderr

def main():
    N, K = (int(x) for x in stdin.readline().split())
    hand = [int(x) for x in stdin.readline().split()]
    q = sorted(hand)[::-1]
    last, pts = 0, 0
    for x in hand:
        if (x < last): continue
        last = x
        if q[-1] < x: pts += 1
        while len(q) > 0 and q[-1] <= x:
            q.pop()
    print(pts)

main()

	Sum	Test	Verdict		Time	Memory
base	30/30
		1	Accepted	0/0	17ms	11120 KiB
		2	Accepted	0/0	127ms	36280 KiB
		3	Accepted	1/1	17ms	11428 KiB
		4	Accepted	1/1	17ms	11604 KiB
		5	Accepted	1/1	17ms	11580 KiB
		6	Accepted	2/2	17ms	11876 KiB
		7	Accepted	2/2	18ms	11896 KiB
		8	Accepted	2/2	17ms	12364 KiB
		9	Accepted	1/1	75ms	27720 KiB
		10	Accepted	2/2	105ms	33744 KiB
		11	Accepted	3/3	107ms	33956 KiB
		12	Accepted	3/3	111ms	33952 KiB
		13	Accepted	1/1	123ms	37148 KiB
		14	Accepted	2/2	128ms	37220 KiB
		15	Accepted	3/3	125ms	37204 KiB
		16	Accepted	3/3	126ms	37436 KiB
		17	Accepted	3/3	128ms	37244 KiB