Submission #8,621

2024-01-23 18:46:02

python3

Wrong answer 14/50

722ms

35832 KiB

def ket():
    N,Q = [int(s) for s in input().split()]
    arak = [int(s) for s in input().split()]
    mini=min(arak)
    maxi=max(arak)
    haszon=0
    vane=False
    for ar in arak:
        if vane:
            if ar==maxi:
                haszon+=maxi
                vane=False
        else:
            if ar==mini:
                haszon-=mini
                vane=True
    for i in range(Q):
        V,E=[int(s) for s in input().split()]
        #kerdesek.append((V,E))
        if V<mini:
            print(0)
            continue
        if E<=maxi:
            print(haszon)
            continue
        if V>=maxi:
            print(-arak[0])
            continue
        print(-mini)
        continue
    
ket()

	Sum	Test	Verdict		Time	Memory
base	14/50
		1	Wrong answer	0/0	17ms	11240 KiB
		2	Wrong answer	0/0	393ms	14040 KiB
		3	Accepted	1/1	17ms	12080 KiB
		4	Accepted	1/1	17ms	12392 KiB
		5	Wrong answer	0/2	17ms	12888 KiB
		6	Wrong answer	0/2	20ms	14796 KiB
		7	Wrong answer	0/2	21ms	14920 KiB
		8	Accepted	1/1	657ms	16204 KiB
		9	Accepted	1/1	643ms	18024 KiB
		10	Accepted	2/2	674ms	19004 KiB
		11	Accepted	2/2	634ms	20672 KiB
		12	Accepted	2/2	632ms	21888 KiB
		13	Accepted	2/2	697ms	22424 KiB
		14	Accepted	2/2	629ms	24540 KiB
		15	Wrong answer	0/3	647ms	25504 KiB
		16	Wrong answer	0/3	625ms	26644 KiB
		17	Wrong answer	0/3	695ms	27940 KiB
		18	Wrong answer	0/3	680ms	29220 KiB
		19	Wrong answer	0/3	625ms	30448 KiB
		20	Wrong answer	0/3	620ms	31636 KiB
		21	Wrong answer	0/3	629ms	32564 KiB
		22	Wrong answer	0/3	722ms	33536 KiB
		23	Wrong answer	0/3	708ms	34788 KiB
		24	Wrong answer	0/3	680ms	35832 KiB