結果
問題 | No.1454 ツブ消ししとるなEasy |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 10:54:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 1,730 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 102,912 KB |
最終ジャッジ日時 | 2024-05-05 00:10:19 |
合計ジャッジ時間 | 4,514 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
89,596 KB |
testcase_01 | AC | 147 ms
89,600 KB |
testcase_02 | AC | 149 ms
89,212 KB |
testcase_03 | AC | 144 ms
89,584 KB |
testcase_04 | AC | 166 ms
102,912 KB |
testcase_05 | AC | 147 ms
89,472 KB |
testcase_06 | AC | 156 ms
89,596 KB |
testcase_07 | AC | 165 ms
100,736 KB |
testcase_08 | AC | 166 ms
100,992 KB |
testcase_09 | AC | 166 ms
101,120 KB |
testcase_10 | AC | 144 ms
89,472 KB |
testcase_11 | AC | 144 ms
89,088 KB |
testcase_12 | AC | 144 ms
89,196 KB |
testcase_13 | AC | 144 ms
89,472 KB |
testcase_14 | AC | 146 ms
89,344 KB |
testcase_15 | AC | 144 ms
89,196 KB |
testcase_16 | AC | 142 ms
89,088 KB |
testcase_17 | AC | 148 ms
89,392 KB |
testcase_18 | AC | 145 ms
89,472 KB |
testcase_19 | AC | 148 ms
89,600 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()