#479020 (PyPy3) No.1046 Fruits Rush

• 問題: No.1046 Fruits Rush
• ユーザー: Mille0x1C
• 提出日時: 2020-05-08 22:46:37
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 153 ms / 2,000 ms
• コード長: 1,599 bytes
• コンパイル時間: 258 ms
• コンパイル使用メモリ: 82,524 KB
• 実行使用メモリ: 91,064 KB
• 最終ジャッジ日時: 2024-07-04 01:03:40
• 合計ジャッジ時間: 3,721 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
from __future__ import print_function
import sys
sys.setrecursionlimit(500000)
import re
import array
import copy
import functools
import operator
import math
import string
import fractions
from fractions import Fraction
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue
from itertools import accumulate
from collections import deque
from collections import Counter
from operator import mul
from functools import reduce
input = sys.stdin.readline
def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return
# from fractions import gcd
# from math import gcd
# def lcm(n, m):
#     return int(n * m / gcd(n, m))
# def coprimize(p, q):
#     common = gcd(p, q)
#     return (p // common, q // common)
# def find_gcd(list_l):
#     x = reduce(gcd, list_l)
#     return x
def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom
def main():
    n,k = map(int,input().strip().split())
    a = list(map(int, input().strip().split()))
    # a = list(map(lambda x: int(x) if int(x)>=0 else 0, input().strip().split()))
    a.sort(reverse=True)
    # eprint(a)
    sumx=0
    for i in range(k):
        if a[i]>0 or i==0:
            sumx+=a[i]
        
    print(sumx)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX