結果
問題 | No.1454 ツブ消ししとるなEasy |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 10:54:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 278 ms / 2,000 ms |
コード長 | 1,730 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 87,344 KB |
実行使用メモリ | 106,484 KB |
最終ジャッジ日時 | 2023-08-17 17:29:12 |
合計ジャッジ時間 | 7,524 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 255 ms
92,300 KB |
testcase_01 | AC | 250 ms
92,268 KB |
testcase_02 | AC | 251 ms
92,356 KB |
testcase_03 | AC | 258 ms
92,360 KB |
testcase_04 | AC | 272 ms
106,484 KB |
testcase_05 | AC | 253 ms
92,468 KB |
testcase_06 | AC | 254 ms
92,288 KB |
testcase_07 | AC | 273 ms
104,804 KB |
testcase_08 | AC | 276 ms
105,020 KB |
testcase_09 | AC | 278 ms
104,656 KB |
testcase_10 | AC | 249 ms
92,088 KB |
testcase_11 | AC | 249 ms
92,472 KB |
testcase_12 | AC | 251 ms
92,356 KB |
testcase_13 | AC | 249 ms
92,488 KB |
testcase_14 | AC | 251 ms
92,136 KB |
testcase_15 | AC | 251 ms
92,132 KB |
testcase_16 | AC | 257 ms
92,300 KB |
testcase_17 | AC | 255 ms
92,316 KB |
testcase_18 | AC | 249 ms
92,312 KB |
testcase_19 | AC | 247 ms
92,388 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 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 def main(): N, M, X, Y = i_map() A = i_list() ans = 0 cou = 0 NA = [] for i in range(N): if A[i] >= X: ans += A[i] cou += 1 elif A[i] <= Y: continue else: NA.append(A[i]) if cou > M: print('Handicapped') exit() NA.sort(reverse=True) nokori = sum(NA[:M-cou]) print(ans + nokori) if __name__ == '__main__': main()