186942025-10-30 23:57:1342Lapozgatáspython3Accepted 100/100115ms25148 KiB
from sys import stdin
input=stdin.readline

def solv():
    M,K,N = list(map(int,input().split()))
    A = list(map(int,input().split()))
    x=y=0
    mini=maxi=K
    for a in A:
        if mini<=a<=maxi:
            continue
        elif a<mini:
            x+=1
            y+=K-a
            K=a
            mini=a
        elif maxi<a:
            x+=1
            y+=a-K
            K=a
            maxi=a
    print(x,y)
    return

solv()
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted16ms3132 KiB
2Accepted17ms2868 KiB
subtask212/12
3Accepted16ms2868 KiB
4Accepted16ms3312 KiB
5Accepted16ms3120 KiB
subtask324/24
6Accepted16ms3140 KiB
7Accepted17ms3120 KiB
8Accepted17ms3080 KiB
9Accepted16ms3320 KiB
10Accepted17ms2988 KiB
11Accepted16ms3108 KiB
subtask428/28
12Accepted115ms24948 KiB
13Accepted104ms24972 KiB
14Accepted105ms24908 KiB
15Accepted92ms24996 KiB
16Accepted86ms24972 KiB
17Accepted83ms24968 KiB
18Accepted90ms25072 KiB
subtask536/36
19Accepted112ms24968 KiB
20Accepted107ms24988 KiB
21Accepted108ms24972 KiB
22Accepted104ms24876 KiB
23Accepted98ms24960 KiB
24Accepted93ms25148 KiB
25Accepted92ms24972 KiB
26Accepted85ms24948 KiB
27Accepted90ms25088 KiB