Problem:


Score: 200 points

Problem Statement

A country decides to build a palace.

In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius.

There are N places proposed for the place. The elevation of Place i is H_i meters.

Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.

Print the index of the place where the palace should be built.

It is guaranteed that the solution is unique.

Constraints

1 \leq N \leq 1000

0 \leq T \leq 50

-60 \leq A \leq T

0 \leq H_i \leq 10^5

All values in input are integers.

The solution is unique.

Input

Input is given from Standard Input in the following format:

N
T A
H_1 H_2 ... H_N

Output

Print the index of the place where the palace should be built.

Sample Input 1

2
12 5
1000 2000

Sample Output 1

1

The average temperature of Place 1 is 12-1000 \times 0.006=6 degrees Celsius.

The average temperature of Place 2 is 12-2000 \times 0.006=0 degrees Celsius.

Thus, the palace should be built at Place 1.

Sample Input 2

3
21 -11
81234 94124 52141

Sample Output 2

3



Sample input:
2
12 5
1000 2000


Sample output:
1

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))
 
res = [abs(T-h*0.006-A) for h in H]
print(res.index(min(res))+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=[int(i) for i in input().split()]
ans=20000
j=0
for i in range(N):
  if ans>abs((T-H[i]*0.006)-A):
    ans=abs((T-H[i]*0.006)-A)
    j=i+1
print(j)

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
ans=1
b=10**5
h=list(map(int,input().split()))
for i in range(n):
  if abs(b-a)>abs(t-h[i]*0.006-a):
    b=t-h[i]*0.006
    ans=i+1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
ans = 10000

for i in range(n):
    if abs(a - (t - h[i] * 0.006)) < ans:
           ans = abs(a - (t - h[i] * 0.006))
           b = i
print(b + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))

res = [abs(T-h*0.006-A) for h in H]
print(res.index(min(res))+1)

Submission status: Accepted

Solution code:
N  = int(input())
T, A = [int(i) for i in input().split()]
H_list = [int(i) for i in input().split()]

ans = float('inf')
res_idx = 0

for i in range(N):  
    tmp = T - H_list[i]*0.006
    diff = abs(tmp - A)
    if diff < ans:
        ans = diff
        res_idx = i + 1
        
print(res_idx)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))

min_dif = float('inf')
idx = 0
for i in range(N):
    temp = T - 0.006 * H[i]
    dif = abs(temp - A)
    if dif < min_dif:
        min_dif = dif
        idx = i + 1
        
print(idx)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
for i in range(n):
    h[i] = abs(a-t+(0.006)*h[i])

print(h.index(min(h))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))

l = list()
for h in range(len(H)):
    l.append(abs(T - H[h] * 0.006 - A))
 
print(l.index(min(l))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))

tlst = [T - x*0.006 for x in H]
min = 10000000

for t in tlst:
    if min > abs(t - A):
        min = abs(t - A)
        ans = tlst.index(t) + 1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))
for i in range(N):
    H[i] = T - H[i]*0.006
h = 100000
a = 0
for i in range(N):
    if abs(H[i]-A) < h:
        h = abs(H[i]-A)
        a = i+1
print(a)

Submission status: Accepted

Solution code:
n=int(input())
t,a = map(int, input().split())
h=list(map(int, input().split()))
temp = [abs(a-(t-h[i]*0.006)) for i in range(n)]
min_temp = pow(10,5)
ans = 0
for i in range(n):
    if temp[i]<min_temp:
        min_temp = temp[i]
        ans = i
print(ans+1)

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
T, A = map(int,input().split())
X = list(map(int,input().split()))

x = np.array(X)
t = T - x*0.006
loss = (t-A)**2
ans = np.argmin(loss) + 1

print(ans)

Submission status: Accepted

Solution code:
#coding: utf-8
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
point = [abs(t - h[i]*0.006 - a) for i in range(len(h))]
print(point.index(min(point)) + 1)

Submission status: Accepted

Solution code:
n=int(input())
t, a = map(int, input().split())
H = list(map(int, input().split()))

min_d = abs(a-(t-H[0]*0.006))
ans = 0
for i in range(n):
    d = abs(a-(t-H[i]*0.006))
    if(min_d > d):
        min_d = d
        ans   = i
print(ans+1)

Submission status: Accepted

Solution code:
N = int(input())
T,A = map(int,input().split())
Heights = list(map(int,input().split()))
sa_list = []
for i in Heights:
    temp = T-i*0.006
    sa = abs(A-temp)
    sa_list.append(sa)
print(sa_list.index(min(sa_list))+1)

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
T, A = map(int, input().split())
height = list(map(int, input().split()))

temp = list(map(lambda x: T - x*0.006, height))

def getNearesValue(list, num):
    idx = np.abs(np.asarray(list) - num).argmin()
    return list[idx]

print(temp.index(getNearesValue(temp, A)) + 1)

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
stack=10**18
for i in range(n):
  if stack>abs(a-(t-0.006*h[i])):
    stack=abs(a-(t-0.006*h[i]))
    ans=i+1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))

t = [abs(T - h * 0.006 - A) for h in H]
print(t.index(min(t))+1)

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
T, A = map(int,input().split())
H = np.array([int(i) for i in input().split()])
H = T - H * 0.006
H = np.abs(H - A)
print(H.argmin()+1)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
h = [abs(t - int(i) * 0.006 - a) for i in input().split()]
print(h.index(min(h)) + 1)

Submission status: Accepted

Solution code:
N = int(input())
T,A = map(int , input().split())
l = list(map(int , input().split()))
k =[abs(A-(T-i*0.006)) for i in l ]
print(k.index(min(k))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = [int(s) for s in input().split(" ")]
H_list = [int(s) for s in input().split(" ")]

temps = [T-0.006*H for H in H_list]

dfs = []
for t in temps:
  df = abs(t-A)
  dfs.append(df)

print(dfs.index(min(dfs))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = [[i, int(h)] for i, h in enumerate(input().split())]
for h in H:
    h[1] = ((T - h[1] * 0.006) - A) ** 2
H.sort(key=lambda x: x[1])
ans = H[0][0]
ans += 1
print(ans)

Submission status: Accepted

Solution code:
#113
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))

temp = abs(a-(t-h[0]*0.006))
ans = 1
for i in range(n):
    dif = abs(a-(t-h[i]*0.006))
    if(dif<temp):
        temp = dif
        ans = i+1
        
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
h = [int(i) for i in input().split()]
h = [abs(t - i * 0.006 - a) for i in h]
print(h.index(min(h)) + 1)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
H = [abs(a-(t-0.006*int(_))) for _ in input().split()]
print(H.index(min(H))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))  # リスト入力（数値）  map関数はリストの各要素に対して関数を適用してくれる

l = list()
for h in range(len(H)):
    l.append(abs(T - H[h] * 0.006 - A))

print(l.index(min(l))+1)

Submission status: Accepted

Solution code:
from sys import exit
N = int(input())
T,A = [int(n) for n in input().split()]
H = [int(n) for n in input().split()]
mnear = 0
mint = (1 << 20)
for i in range(N):
    # print(T - H[i]*0.006)
    if abs(A - (T - H[i]*0.006)) < mint:
        mint = abs(A - (T - H[i]*0.006))
        mnear = i

print(mnear+1)
exit()

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
Hs = list(map(int,input().split()))
ts = []
for H in Hs:
    ts.append(T - H * 0.006)
min_t = 10**6
min_idx = 0
for idx, t in enumerate(ts):
    if abs(t - A) < min_t:
        min_t = abs(t - A)
        min_idx = idx
print(min_idx+1)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
l = list(map(int, input().split()))
l = list(map(lambda x: t - x * 0.006 , l))
l = list(map(lambda x: abs(x - a), l))
print(l.index(min(l))+ 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = [int(x) for x in input().split()]
H = list(map(int, input().split()))
min = 100000
result = 0

for i in range(N):
    if abs(A - (T-H[i]*0.006)) < min:
        min = abs(A - (T-H[i]*0.006))
        result = i+1

print(result)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
place = 0
tmp = 10e9
for i in range(len(h)) :
  temp = t - h[i]*0.006
  if(tmp > abs(temp - a)) : 
    tmp = abs(temp - a)
    place = i
print(place+1)

Submission status: Accepted

Solution code:
def main113():
    import numpy as np
    N = int(input())
    T, A = (int(x) for x in input().split())
    H = list(map(int,input().split()))

    T_list = [T] * N
    A_list = [A] * N

    def temperature(T, A, x):
        return abs(A - (T - x * 0.006))

    answer = list(map(temperature, T_list, A_list, H))

    print(np.argmin(np.array(answer)) + 1)



main113()

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
h=list(map(lambda x:t-x*0.006,h))
tmp=[abs(i-a) for i in h]
print(tmp.index(min(tmp))+1)

Submission status: Accepted

Solution code:
N = int(input())
T,A = map(int,input().split())
H = input().split()

for i in range(N):
  tmp = T - int(H[i])*0.006
  if(i == 0):
    min = abs(A-tmp)
    ans_num = i+1
  else:
    if(min > abs(A-tmp)):
      min = abs(A-tmp)
      ans_num = i+1
      
print(ans_num)

Submission status: Accepted

Solution code:
# 入力
N = int(input())
[T,A] = list(map(int, input().split()))
H = list(map(int, input().split()))

# 処理
ans_idx = -1  # 答えとなる地点のインデックス
ans_t   = -1  # 答えとなる地点の気温
for i in range(N):
  t = T - H[i]*0.006  # i番目の地点の気温
  if ans_idx < 0 or abs(t-A) < abs(ans_t-A):
    ans_idx = i
    ans_t = t

# 答え
print(ans_idx+1)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
H = list(map(int,input().split()))
temprature = []
for h in H:
    temprature.append(abs(a-(t-h*0.006)))
print(temprature.index(min(temprature))+1)

Submission status: Accepted

Solution code:
N = int(input())
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))


tmp = 10 ** 18
best_h = -1

for i,h in enumerate(H):
  _tmp = T - h * 0.006
  diff_tmp = abs(tmp - A)
  diff__tmp = abs(_tmp - A)
  
  if diff__tmp < diff_tmp:
    best_h = i + 1
    tmp = _tmp


print(best_h)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
tmp = 10**9
for i in range(N):
    if abs(A - T + H[i] * 0.006) < tmp:
        tmp = abs(A - T + H[i] * 0.006)
        ans = i + 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
t, a = [int(item) for item in input().split()]
hs = [int(item) for item in input().split()]

temp = 10**6
for i, h in enumerate(hs):
  if abs(a - (t - h*(0.006))) < temp:
    id = i+1
    temp = abs(a - (t - h*(0.006)))
  
print(id)

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
D = [abs(T - h * 0.006 - A) for h in H]
print(D.index(min(D)) + 1)

Submission status: Accepted

Solution code:
N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
B = abs(A-(T-0.006*H[0]))
for i in range(N):
    C = abs(A-(T-0.006*H[i]))
    if B>=C:
        B = C
        ans = i+1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
(t, a) = map(int, input().split())
h = list(map(int, input().split()))

min_i = 0
min_t = 10 ** 6
for i, h_i in enumerate(h):
    diff = abs(t - h_i * 0.006 - a)
    if min_t > diff:
        min_i = i
        min_t = diff
print(min_i + 1)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
buf = abs(a - t + h[0]*0.006)
ans = 0
for i in range(n):
    if abs(a - t + h[i]*0.006) < buf:
        ans = i
        buf = abs(a - t + h[i]*0.006)
print(ans+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=map(int,input().split())
D=list(abs(T-int(x)*0.006-A) for x in H)
print(D.index(min(D))+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
D=[abs(T-A-0.006*x) for x in H]
print(1+D.index(min(D)))

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
temp=9999
for i in range(len(h)):
    if temp>abs((t-h[i]*0.006)-a):
        temp=abs((t-h[i]*0.006)-a)
        ans=i+1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(float, input().split())
D = [float(_) for _ in input().split()]
E = []
for i in range(N):
    E.append(abs(A - (T - D[i] * 0.006)))
ans = E.index(min(E)) + 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
hs = list(map(int,input().split()))

l = [abs(t-h*0.006-a) for h in hs]
print(l.index(min(l))+1)

Submission status: Accepted

Solution code:
# ABC113-B
N = int(input())
T, A = (int(x) for x in input().split())
H = [T - int(x) * 0.006 for x in input().split()]
zi = 0
zdiff = 10000
for i in range(len(H)):
    zt = abs(A - H[i])
    if zt < zdiff:
        zi = i
        zdiff = zt
print(zi + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))
ans = 1e9
for h in H:
  x = abs(T-h*0.006-A)
  if(ans > x):
    tmp = h
    ans = x
print(H.index(tmp)+1)

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
T, A = map(int, input().split(' '))
H = np.array(list(map(int, input().split(' '))))
H = np.abs(T - H*0.006 - A)
print(np.argmin(H)+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
HT = list(map(lambda x: T - x*0.006, H))
answer = 0
for i in range(len(HT)):
    if abs(HT[i] - A) < abs(HT[answer]-A):
        answer = i
print(answer + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
HT = list(map(lambda x: T - x*0.006, H))
answer = 0
for i in range(len(HT)):
    if abs(HT[i] - A) < abs(HT[answer]-A):
        answer = i
print(answer + 1)

Submission status: Accepted

Solution code:
#! python
N = int(input())
T,A = [int(x) for x in input().split()]
Hlist = [int(x) for x in input().split()]

sublist = [abs(A-(T-x*0.006)) for x in Hlist]
print(sublist.index(min(sublist))+1)

Submission status: Accepted

Solution code:
import numpy as np
N=int(input())
T,A=map(int,input().split())
H=[int(i) for i in input().split()]
idx=np.abs(T-0.006*np.asarray(H)-A).argmin()
print(idx+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = [int(_) for _ in input().split()]
tmp = 1000
pos = 0

for p, x in enumerate((int(_) for _ in input().split())):
    t = abs(T - x * 0.006 - A)
    if tmp > t:
        tmp = t
        pos = p

print(pos + 1)

Submission status: Accepted

Solution code:
N =int(input())
T,A = tuple(map(int,input().split()))
import numpy as np
H = np.array(list(map(int,input().split())))
print(np.argmin(np.abs((A - (T - H*0.006))))+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
temp=[abs(A-(T-H[i]*0.006)) for i in range(N)]
for i in range(N):
    if temp[i]==min(temp):
        print(i+1)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int, input().split())
data = list(map(int, input().split()))

ideal_temp = a - 10**5
for i in range(n):
  now_temp = t - (data[i]* 0.006)
  if abs(a - now_temp) < abs(a - ideal_temp):
    res = i + 1
    ideal_temp = now_temp
print(res)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = [int(i) for i in input().split()]

temp = [(T - h * 0.006) for h in H]
diff = [abs(A - t) for t in temp]
print(diff.index(min(diff)) + 1)

Submission status: Accepted

Solution code:
n = int(input())
(t,a) = map(int, input().split())
hs = list(map(int, input().split()))

def calc(h):
    return abs((t - 0.006 * h) - a)

def findMinIndex(xs):
    minv = xs[0]
    mini = 0
    for i in range( len(xs)):
        #print(xs[i], minv)
        if xs[i] < minv:
            minv = xs[i]
            mini = i
    return mini


res = findMinIndex(list(map(calc, hs)))
print(res+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
Hl=map(int,input().split())
Tl=list(map(lambda H:abs(T-H*0.006-A), Hl))
print(Tl.index(min(Tl))+1)

Submission status: Accepted

Solution code:
# s=input()
# if s<='2019/4/30':
# 	print("Heisei")
# else:
# 	print("TBD")

n=int(input())
t,a=map(int,input().split())
array= list(map(int,input().split()))

min=100000
count=0

for i in range(0,n):
	array[i]=t-array[i]*0.006
	array[i]=abs(a-array[i])
	if min>array[i]:
		min=array[i]
		count=i

print(count+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int,input().split()))
t = [abs(T - H[i]*0.006-A) for i in range(N)]
print(t.index(min(t))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = [int(s) for s in input().split()]
H_list = [int(s) for s in input().split()]
mt_list = [abs(A-(T - 0.006 * H)) for H in H_list]
print(mt_list.index(min(mt_list))+1)

Submission status: Accepted

Solution code:
def ans():
  N = int(input())
  T, A = map(int,input().split())
  H = list(map(int,input().split()))
  res = 1e9
  for h in H:
    x = abs(T-h*0.006-A)
    if(res > x):
      res = x
      tmp = h
  print(H.index(tmp)+1)
ans()

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
Hi = list(map(int, input().split()))

min_diff = 10000000000
selected = -1
for i, h in enumerate(Hi):
    t = T - h * 0.006
    d = abs(t - A)
    if d < min_diff:
        min_diff = d
        selected = i
print(selected + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))
num = 1000000
ans = 0
for i in range(N):
  tmp = T-H[i]*0.006
  if abs(tmp-A)<abs(num-A):
    num = tmp
    ans = i+1
print(ans)

Submission status: Accepted

Solution code:
N, = (int(x) for x in input().split())
T,A = (int(x) for x in input().split())
H_arr = [int(x) for x in input().split()]

min_state = (-1, 100000)
for i, H in enumerate(H_arr):
    T_diff = abs(T-H*0.006-A)
    if T_diff < min_state[1]:
        min_state = (i+1, T_diff)

print(min_state[0])

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
ans, m = 0, 1e9
for i in range(N):
  if abs((T-H[i]*0.006) - A) < m:
    ans = i+1
    m = abs((T-H[i]*0.006) - A)
print(ans)

Submission status: Accepted

Solution code:
def palace(N: int, T: int, A: int, H: list) -> int:
    best_t = float('inf')
    best_i = 0

    for i, h in enumerate(H):
        t = T - 0.006*h
        if abs(A - best_t) > abs(A - t):
            best_t = t
            best_i = i

    return best_i + 1


if __name__ == "__main__":
    N = int(input())
    T, A = map(int, input().split())
    H = map(int, input().split())
    ans = palace(N, T, A, H)
    print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc113/tasks/abc113_b
n = int(input())
t, a = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
h2 = [abs(t - x * 0.006 - a) for x in h]
print(h2.index(min(h2)) + 1)

Submission status: Accepted

Solution code:
_=input()
T,A = map(int,input().split())
H = [int(x) for x in input().split()]
min_i = -1
min_d = 10**10
for i,h in enumerate(H):
  d = abs(A-(T-h*0.006))
  if d<min_d:
    min_d=d
    min_i=i
print(min_i+1)

Submission status: Accepted

Solution code:
from sys import stdin
n = int(stdin.readline().rstrip())
t, a = [int(x) for x in stdin.readline().rstrip().split()]
hs = [int(x) for x in stdin.readline().rstrip().split()]

answers=[t-h*0.006 for h in hs]

answers=[abs(an-a) for an in answers]

print(answers.index(min(answers))+1)

Submission status: Accepted

Solution code:
N  = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))
sub = list(map(lambda x: abs(A - (T - x * 0.006)),H))
print(sub.index(min(sub))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
p_idx = 0
p_diff = 10000.0
for i in range(N):
    if p_diff > abs(T - H[i]*0.006 - A):
        p_diff = abs(T - H[i]*0.006 - A)
        p_idx = i+1
print(p_idx)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
h = list(map(int,input().split()))
ans1 = 10**7
ans2 = 0
for i in range(n):
    tmp = t - h[i]*0.006
    if abs(tmp-a) < abs(ans1-a):
        ans1 = tmp
        ans2 = i+1
print(ans2)

Submission status: Accepted

Solution code:
n= int(input())
t,a = map(int, input().split())
h=[int(i) for i in input().split()]
mini=[1,abs(t-(h[0]*0.006)-a)]
for i in range(n):
    dh=abs(t-(h[i]*0.006)-a)
    if mini[1]>dh:
        mini[0]=i+1
        mini[1]=dh
print(mini[0])

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
li = list(map(int,input().split()))

listT=[0]*n
for i in range(n):
  listT[i]=t-0.006*li[i]
#print(listT)
min=abs(listT[0]-a)
#print(listT[0]-a)
#print(min)
ans=1
for i in range(n):
  if min>abs(a-listT[i]):
    min=abs(a-listT[i])
    ans=i+1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))

def calc_temp(x):
    return T - x * 0.006

min_diff = 10 ** 9
i = 1
ans_i = 1
for Hi in H:
    diff = abs(A - calc_temp(Hi))
    if diff < min_diff:
        min_diff = diff
        ans_i = i
    i += 1

print(ans_i)

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
N = int(input())
T, A = [int(x) for x in stdin.readline().rstrip().split()]
H = list(map(int, input().split()))
d = []

for i in range(len(H)):
    d.append(abs(T-H[i]*0.006-A))
print(np.argmin(d)+1)

Submission status: Accepted

Solution code:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
INF = 10**18

N=ri()
T,A=rl()
H=rl()
dif = INF
ans = 0
for i in range(N):
    res = abs(A - (T-H[i]*0.006))
    if dif > res:
        dif = res
        ans = i+1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
X = [abs(A - (T - h*0.006)) for h in H]
print(X.index(min(X)) + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int,input().split())
H = list(map(int,input().split()))

t = [abs((T-H[i]*0.006)-A) for i in range(N)]
print(t.index(min(t))+1)

Submission status: Accepted

Solution code:
n = int(input())

t,a = map(float,input().split())

h = list(map(float,input().split()))

temp = []

for i in range(n):
	temp.append(abs(a-t+h[i] * 0.006))

print(temp.index(min(temp)) + 1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
temp = list(map(int, input().split()))
temp_diff = list(abs(A - T + 0.006*temp[i]) for i in range(N))
print(temp_diff.index(min(temp_diff))+1)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
abs_list = []

for i in range(n):
    tmp = t - h[i] * 0.006
    abs_list.append(abs(a - tmp))

print(abs_list.index(min(abs_list)) + 1)

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools


sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


N = I()
T, A = LI()
H = LI()

result = 10**18
result_idx = 0
for idx, h in enumerate(H):
    height = T - h * 0.006
    if abs(A - height) < result:
        result = abs(A - height)
        result_idx = idx + 1

print(result_idx)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())

l=[t-j*0.006 for j in map(int,input().split())]
x = 0

for i in range(len(l)):
    if abs(l[i] - a) <= abs(l[x] - a):
        x = i

print(x+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=[int(x) for x in input().split()]
s=float("inf")
j=0
for i in range(N):
  tempgap=abs(T-H[i]*0.006-A)
  if tempgap<s:
    s,j=tempgap,i
print(j+1)

Submission status: Accepted

Solution code:
input()
t,a=map(int, input().split())
l=[ t - j * 0.006 for j in map(int, input().split())]
x=0
for i in range(1,len(l)):
  if abs(l[i] - a) <= abs(l[x] - a):
    x=i
print(x+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
diff = [abs(T - x * 0.006 - A) for x in map(int, input().split())]
print(diff.index(min(diff)) + 1)

Submission status: Accepted

Solution code:
n=int(input())
t,a=map(int,input().split())
l=list(map(int,input().split()))
for i in range(n):
    l[i]=abs(a-(t-l[i]*0.006))
print(l.index(min(l))+1)

Submission status: Accepted

Solution code:
n = int(input())
t, a = map(int, input().split())
H = list(map(int, input().split()))
k = 10**9
x = 0
for i in range(n):
    if k > abs(a-(t - H[i]*0.006)):
        k = abs(a-(t - H[i]*0.006))
        x = i+1

print(x)

Submission status: Accepted

Solution code:
N, T, A, *H = map(int, open(0).read().split())

h = [abs(T - x * 0.006 - A) for x in H]
print(h.index(min(h)) + 1)

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
t,a = map(int,input().split())
h = list(map(int, input().split()))
ts = np.array([t-0.006*x for x in h])
ts = np.abs(ts-a)
print(np.argmin(ts)+1)

Submission status: Accepted

Solution code:
n = int(input())

sit = input().split()

T = float(sit[0])
A = float(sit[1])
sc = []
D = []
i = 0
data = input().split()

while i < n:
  D.append(float(data[i]))
  sc.append(T - D[i] * 0.006)
  i += 1
i = 0
res = []
while i < n:
  res.append(abs((A-sc[i])))
  i += 1
mn = min(res)
ans = res.index(mn)


print(ans+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H_lst = list(map(int, input().split()))
min_remainder = 1000
min_index = -1
for i in range(N):
    temperature = T - H_lst[i] * 0.006
    tmp_remainder = abs(A - temperature)
    if tmp_remainder < min_remainder:
        min_remainder = tmp_remainder
        min_index = i + 1

print(min_index)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
s=12000
p=0
H=list(input().split())
for i in range(N):
    H[i]=int(H[i])
    t=abs(A-(T-H[i]*0.006))
    if s>t:
        s=t
        p=i+1
print(p)

Submission status: Accepted

Solution code:
N = int(input())
T,A = map(int, input().split())
list_H = list(map(int, input().split()))

ls = [abs(A-(T-x*6/1000)) for x in list_H]
print(ls.index(min(ls))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A  = map(int, input().split())
H = list(map(int,input().split()))
L = list()
for i in range(len(H)):
    L.append(abs((T - H[i] * 0.006) - A))
print(L.index(min(L))+1)

Submission status: Accepted

Solution code:
_,t,a,*h=map(int,open(0).read().split());m=[abs(t-6e-3*x-a)for x in h];print(m.index(min(m))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = [int(x) for x in input().split()]
L = list()
for i in range(N):
  L.append(abs((T - 0.006 * H[i]) - A))
print(L.index(min(L))+1)

Submission status: Accepted

Solution code:
from numpy import argmin


def solve(string):
    n, t, a, *h = map(int, string.split())

    return str(argmin([abs(t - _h * 0.006 - a) for _h in h]) + 1)


if __name__ == '__main__':
    print(solve("\n".join([input(), input(), input()])))

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
T, A = map(int, input().split())
H = [int(i) for i in input().split()]
H = np.array(H)

C = T - H*0.006
A = np.ones_like(H)*A

delta = C - A
delta = delta**2

print(np.argmin(delta) + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Feb 27 00:28:31 2019

@author: yuta
"""

def palace(n,ta,h):
    ta2 = list(map(int,ta))
    h2 = list(map(int,h))
    temp = list(map(lambda i:ta2[0]-i*0.006, h2))
    near = list(map(lambda i:abs(i-ta2[1]), temp))
    nearest = min(near)
    print(near.index(nearest)+1)

x = input()
y = input().split()
z = input().split()

palace(x,y,z)

Submission status: Accepted

Solution code:
n=int(input())
t,a=(int(x) for x in input().split())
h=[int(x) for x in input().split()]
sa=[]
for i in range(n):
    kion=t-h[i]*0.006
    sa.append(abs(a-kion))
print(sa.index(min(sa))+1)

Submission status: Accepted

Solution code:
N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
INF=10**4
mini=INF
index=0

for i in range(N):
  temp=T-H[i]*0.006
  if abs(temp - A) < mini:
    mini=abs(temp-A)
    index=i+1

print(index)

Submission status: Accepted

Solution code:
n = int(input())
t,a = map(int,input().split())
li = list(map(int,input().split()))
p = []
for i in range(len(li)):
    m = abs(a-(t - 0.006 * li[i]))
    p.append(m)

print((p.index(min(p)) + 1))

Submission status: Accepted

Solution code:
_,t,a,*h=map(int,open(0).read().split());b=[abs(t-i*0.006-a)for i in h];print(b.index(min(b))+1)

Submission status: Accepted

Solution code:
n,t,a,*h=map(int,open(0).read().split())
b=[abs(a-(t-i*0.006))for i in h]
print(b.index(min(b))+1)

Submission status: Accepted

Solution code:
N = int(input())
T, A = map(int, input().split())
H = [abs(T - int(i) * 0.006 - A) for i in input().split()]
print(H.index(min(H)) + 1)