Submission #11,234

2024-07-26 11:04:18

python3

Wrong answer 18/40

107ms

27932 KiB

#fasor
#sor1 = '10 3'
sor1 = input()

hatar = int(sor1.split(' ')[0])
k = int(sor1.split(' ')[1])

#fak = [int(i) for i in '6 2 1 8 4 8 7 12 9 3'.split(' ')]
fak = [int(i) for i in input().split(' ')]
p = fak.index(max(fak))
#print(len(fak), p, hatar-k)
while len(fak) > 2*k+1 and p > k and p <= hatar-k:
    hatar = p
    fak = fak[:hatar]
    
print(fak.index(max(fak))+1)

	Sum	Test	Verdict		Time	Memory
base	18/40
		1	Accepted	0/0	17ms	2916 KiB
		2	Wrong answer	0/0	21ms	4112 KiB
		3	Accepted	2/2	17ms	2960 KiB
		4	Wrong answer	0/2	17ms	2960 KiB
		5	Accepted	2/2	17ms	2916 KiB
		6	Wrong answer	0/2	17ms	2916 KiB
		7	Accepted	2/2	17ms	3060 KiB
		8	Accepted	2/2	17ms	3172 KiB
		9	Accepted	2/2	21ms	4112 KiB
		10	Wrong answer	0/2	21ms	4068 KiB
		11	Wrong answer	0/2	21ms	4096 KiB
		12	Accepted	2/2	20ms	3828 KiB
		13	Wrong answer	0/2	59ms	14644 KiB
		14	Accepted	2/2	57ms	14520 KiB
		15	Wrong answer	0/2	101ms	25908 KiB
		16	Wrong answer	0/2	97ms	25956 KiB
		17	Wrong answer	0/2	105ms	27784 KiB
		18	Wrong answer	0/2	107ms	27932 KiB
		19	Wrong answer	0/2	97ms	27796 KiB
		20	Accepted	2/2	50ms	11260 KiB
		21	Wrong answer	0/2	93ms	26128 KiB
		22	Accepted	2/2	97ms	24968 KiB