結果
問題 | No.2334 Distinct Cards |
ユーザー | McGregorsh |
提出日時 | 2023-06-02 22:44:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 293 ms / 2,000 ms |
コード長 | 1,740 bytes |
コンパイル時間 | 538 ms |
コンパイル使用メモリ | 87,164 KB |
実行使用メモリ | 127,492 KB |
最終ジャッジ日時 | 2023-08-28 04:57:35 |
合計ジャッジ時間 | 8,317 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
92,332 KB |
testcase_01 | AC | 243 ms
92,496 KB |
testcase_02 | AC | 240 ms
92,256 KB |
testcase_03 | AC | 241 ms
92,356 KB |
testcase_04 | AC | 240 ms
92,384 KB |
testcase_05 | AC | 235 ms
92,320 KB |
testcase_06 | AC | 245 ms
92,372 KB |
testcase_07 | AC | 239 ms
92,536 KB |
testcase_08 | AC | 241 ms
92,484 KB |
testcase_09 | AC | 241 ms
92,324 KB |
testcase_10 | AC | 239 ms
92,308 KB |
testcase_11 | AC | 243 ms
92,284 KB |
testcase_12 | AC | 293 ms
120,428 KB |
testcase_13 | AC | 290 ms
120,636 KB |
testcase_14 | AC | 287 ms
117,072 KB |
testcase_15 | AC | 289 ms
120,444 KB |
testcase_16 | AC | 290 ms
120,556 KB |
testcase_17 | AC | 284 ms
127,492 KB |
testcase_18 | AC | 282 ms
127,312 KB |
testcase_19 | AC | 282 ms
127,328 KB |
testcase_20 | AC | 266 ms
106,752 KB |
testcase_21 | AC | 261 ms
106,776 KB |
testcase_22 | AC | 259 ms
106,936 KB |
testcase_23 | AC | 235 ms
92,532 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #input = sys.stdin.readline def main(): N, K = i_map() A = i_list() C = Counter(A) nums = [] for key, value in C.items(): nums.append(value) ans = 0 nums.sort(reverse=True) for i in range(len(nums)): ans += nums[i] if ans >= K: print(i+1) exit() if __name__ == '__main__': main()