Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def solve():
- n, x, k = [int(i) for i in input().split(' ')]
- t_arr = [int(i) for i in input().split(' ')]
- Ts = sorted(list(set(t_arr)))[:k]
- len_ts = len(Ts)
- counter = 0
- day = 0
- while True:
- day = Ts[0]
- counter += 1
- if counter == k:
- print(day)
- return
- Ts[0] += x
- i = 0
- while i < len_ts - 1 and Ts[i] >= Ts[i + 1]:
- if Ts[i] == Ts[i + 1]:
- Ts.remove(Ts[i])
- len_ts -= 1
- break
- Ts[i], Ts[i + 1] = Ts[i + 1], Ts[i]
- i += 1
- if __name__ == '__main__':
- solve()
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement