結果

問題 No.2334 Distinct Cards
ユーザー Alex WiceAlex Wice
提出日時 2023-06-02 21:21:18
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 97 ms / 2,000 ms
コード長 2,881 bytes
コンパイル時間 246 ms
コンパイル使用メモリ 81,792 KB
実行使用メモリ 101,632 KB
最終ジャッジ日時 2024-06-08 22:06:05
合計ジャッジ時間 2,609 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
54,528 KB
testcase_01 AC 47 ms
54,784 KB
testcase_02 AC 47 ms
54,400 KB
testcase_03 AC 45 ms
54,784 KB
testcase_04 AC 45 ms
54,784 KB
testcase_05 AC 44 ms
54,912 KB
testcase_06 AC 43 ms
54,400 KB
testcase_07 AC 44 ms
55,296 KB
testcase_08 AC 45 ms
55,424 KB
testcase_09 AC 46 ms
55,296 KB
testcase_10 AC 45 ms
55,424 KB
testcase_11 AC 47 ms
55,040 KB
testcase_12 AC 92 ms
95,360 KB
testcase_13 AC 91 ms
95,616 KB
testcase_14 AC 97 ms
97,152 KB
testcase_15 AC 93 ms
96,256 KB
testcase_16 AC 92 ms
96,000 KB
testcase_17 AC 84 ms
99,712 KB
testcase_18 AC 87 ms
100,608 KB
testcase_19 AC 86 ms
101,632 KB
testcase_20 AC 73 ms
83,456 KB
testcase_21 AC 70 ms
83,328 KB
testcase_22 AC 68 ms
82,944 KB
testcase_23 AC 45 ms
54,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict as ddic, Counter
from itertools import groupby
from heapq import *

MOD = 10**9 + 7
# MOD = 998244353
from math import log2


def gprimes(n):
    sieve = [True] * n
    for i in range(3, int(n**0.5) + 1, 2):
        if sieve[i]:
            sieve[i * i :: 2 * i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
    return [2] + [i for i in range(3, n, 2) if sieve[i]]


# primes = gprimes(int(1e5))
# print("P", len(primes))


def solve():
    N, K = rlist()
    A = rlist()
    count = Counter(A)
    vals = sorted(count.values())
    taken = 0
    ans = 0
    while taken < K:
        taken += vals.pop()
        ans += 1
    return ans


def main():
    T = 1
    # T = rint()

    for tc in range(T):
        ans = solve()
        print(ans)
        # print("First" if ans else "Second")
        # print(*ans)
        # print("YES" if ans else "NO")


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
rint = lambda: int(input())


def rlist(n=0):
    if n == 0:
        return list(map(int, input().split()))
    return [list(map(int, input().split())) for _ in range(n)]


# endregion

if __name__ == "__main__":
    main()
0