Submission #11,694

2024-11-05 22:15:44

python3

Accepted 75/75

206ms

15532 KiB

I,R=input,range
n,k=map(int,I().split())
A=[*map(int,I().split())]
A.sort(reverse=1)
a=b=0
for i in R(n-k):
 if i%2==0:a+=A[i]
 else:b+=A[i]
x=[0]*k
x[-1]=A[-1]
for i in R(1,k):x[-1-i]=x[-i]+A[-1-i]
for i in R(k):
 if x[i]>A[n-k+i]:
  if (n-k-i)%2==0:a+=x[i]
  else:b+=x[i]
  break
 else:
  if (n-k-i)%2==0:a+=A[n-k+i]
  else:b+=A[n-k+i]
print(a,b)

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	16ms	3148 KiB
		2	Accepted	0/0	17ms	3056 KiB
		3	Accepted	2/2	17ms	3128 KiB
		4	Accepted	3/3	16ms	3132 KiB
		5	Accepted	3/3	17ms	3148 KiB
		6	Accepted	2/2	17ms	3216 KiB
		7	Accepted	3/3	19ms	3508 KiB
		8	Accepted	2/2	18ms	3388 KiB
		9	Accepted	3/3	17ms	3388 KiB
		10	Accepted	2/2	17ms	3460 KiB
		11	Accepted	3/3	18ms	3388 KiB
		12	Accepted	1/1	107ms	15072 KiB
		13	Accepted	2/2	112ms	15196 KiB
		14	Accepted	1/1	105ms	15200 KiB
		15	Accepted	2/2	115ms	15284 KiB
		16	Accepted	1/1	97ms	14052 KiB
		17	Accepted	2/2	100ms	15184 KiB
		18	Accepted	1/1	93ms	13884 KiB
		19	Accepted	2/2	63ms	12104 KiB
		20	Accepted	2/2	61ms	12216 KiB
		21	Accepted	3/3	103ms	15384 KiB
		22	Accepted	2/2	101ms	15532 KiB
		23	Accepted	3/3	107ms	15276 KiB
		24	Accepted	2/2	101ms	15288 KiB
		25	Accepted	3/3	105ms	15448 KiB
		26	Accepted	2/2	112ms	15380 KiB
		27	Accepted	3/3	143ms	15376 KiB
		28	Accepted	2/2	206ms	15372 KiB
		29	Accepted	3/3	108ms	15204 KiB
		30	Accepted	3/3	16ms	3128 KiB
		31	Accepted	3/3	17ms	3128 KiB
		32	Accepted	3/3	16ms	3128 KiB
		33	Accepted	3/3	16ms	3128 KiB
		34	Accepted	3/3	17ms	3128 KiB