problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p03207 | u813371068 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['a=sorted( [int(input()) for _ in range(int(input()))] )\na[0] //= 2\nprint(sum(a))', 'N = int(input())\np = []\n[p.append(int(input())) for _ in range(N)]\nprint(sum(p) - int(max(p)/2) )'] | ['Wrong Answer', 'Accepted'] | ['s600711761', 's235146509'] | [3060.0, 2940.0] | [20.0, 18.0] | [80, 97] |
p03207 | u814663076 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = [0] * N\nmax_value = 0\n\nfor i in range(N):\n p[i] = int(input())\n max_value = max(max_value, p[i])\n\nprice = sum(p) - max_value / 2\nprint(int(price)', 'N = int(input())\np = [0] * N\nmax_value = 0\n\nfor i in range(N):\n p[i] = int(input())\n max_value = max(max_value, p[i])\n\nprice = sum(p) - max_value / 2\nprint(int(price))'] | ['Runtime Error', 'Accepted'] | ['s420630405', 's940755645'] | [2940.0, 3060.0] | [18.0, 17.0] | [172, 173] |
p03207 | u814986259 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = [0] * N\nfor i in range(N):\n p[i]=int(input())\n \np = sorted(p,reverse=True)\nans = p.pop(0) / 2 +sum(p)\nprint(ans)', 'N = int(input())\np = [0] * N\nfor i in range(N):\n p[i]=int(input())\n \np = sorted(p,reverse=True)\nans += p.pop(0) / 2 +sum(p)\nprint(ans)', 'N = int(input())\np = [0] * N\nfor i in range(N):\n p[i]=int(input())\n \np = sorted(p,reverse=True)\nans = p.pop(0) / 2 +sum(p)\nprint(int(ans))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s285358813', 's594490805', 's642487405'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [135, 136, 140] |
p03207 | u815498317 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = []\nfor i in range(N):\n p.append(int(input()))\n\nans = sum(p) - max(p)/2\n\nprint(ans)\n', 'N = int(input())\np = []\nfor i in range(N):\n p.append(int(input()))\n\nans = sum(p) - max(p)/2\n\nprint(int(ans))\n'] | ['Wrong Answer', 'Accepted'] | ['s599413125', 's347946917'] | [2940.0, 2940.0] | [17.0, 17.0] | [107, 112] |
p03207 | u818145161 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['import sys;t = [int(l) for l in sys.stdin];print(int(sum([i for n,i in enumerate(t) if n != t.index(max(t))]) + max(t) /2))\n', 'import sys;t = [int(l) for l in sys.stdin];t=t[1:t[0]+1];print(int(sum([i for c,i in enumerate(t) if c != t.index(max(t))]) + max(t) /2))\n'] | ['Wrong Answer', 'Accepted'] | ['s477367698', 's284148025'] | [2940.0, 2940.0] | [18.0, 18.0] | [124, 138] |
p03207 | u821084099 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = []\nfor i in range(N):\n p.append(int(input())\nsum = 0\nmax_value = max(p)\np.remove(max_value)\n\nsum += max_value/2\n\nfor i in p:\n sum += i\n\nprint(sum)', 'N = int(input())\np = []\nfor i in range(N):\n p.append(int(input()))\nsum = 0\nmax_value = max(p)\np.remove(max_value)\n\nsum += max_value/2\n\nfor i in p:\n sum += i\n\nprint(int(sum))'] | ['Runtime Error', 'Accepted'] | ['s848131004', 's489324010'] | [2940.0, 3060.0] | [17.0, 17.0] | [182, 188] |
p03207 | u821432765 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = [int(input()) for _ in range(n)]\nex = l.pop(l.index(max(l)))\nprint(int(ex / 1) + sum(l))', 'n = int(input())\np = [int(input()) for _ in range(n)]\nex = p.pop(p.index(max(p)))\nprint(int(ex / 2) + sum(p))'] | ['Runtime Error', 'Accepted'] | ['s501526860', 's332128640'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 109] |
p03207 | u821775079 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['p=sorted([int(input()) for _ in range(int(input()))])\nprint(sum(p[0:-1]+p[-1]/2)', 'p=sorted([int(input()) for _ in range(int(input()))])\nprint(sum(p[0:-1])+p[-1]//2)'] | ['Runtime Error', 'Accepted'] | ['s363452257', 's882738396'] | [2940.0, 2940.0] | [17.0, 18.0] | [80, 82] |
p03207 | u824981218 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = []\nfor i in range(N):\n \tp_i = int(input())\n \tp.append(p_i)\n \np[p.index(max(p))] *= 1/2\nprint(sum(p))\n', 'N = int(input())\np = []\nfor i in range(N):\n p_i = int(input())\n p.append(p_i)\n \np[p.index(max(p))] *= 1/2\nprint(sum(p))', 'N = int(input())\np = []\nfor i in range(N):\n p_i = int(input())\n p.append(p_i)\n \np[p.index(max(p))] *= 1/2\nprint(int(sum(p)))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s583272354', 's827741219', 's703812153'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 18.0] | [125, 122, 132] |
p03207 | u826557401 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\n\nprice_list = []\n\nfor _ in range(n):\n\tprice_list.append(int(input()))\n\nprint(sum(price_list)-max(price_list)/2)', 'n = int(input())\n\nprice_list = []\n\nfor _ in range(n):\n\tprice_list.append(int(input()))\n\nprint(int(sum(price_list)-max(price_list)/2))'] | ['Wrong Answer', 'Accepted'] | ['s882682281', 's594467882'] | [2940.0, 2940.0] | [18.0, 17.0] | [128, 133] |
p03207 | u843318346 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\narr = []\nfor i in range(n):\n arr[i]=int(input())\narr.sort()\nans = arr[-1]//2+sum(arr[:-1])\nprint(ans)', 'n = int(input())\narr = [0]*n\nfor i in range(n):\n arr[i]=int(input())\narr.sort()\nans = arr[-1]//2+sum(arr[:-1])\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s421227482', 's531759239'] | [3060.0, 2940.0] | [18.0, 18.0] | [119, 125] |
p03207 | u843932857 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nl[s]=l[s]/2\nprint(sum(l))', 'n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nprint(sum(l)-m/2)', 'n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nl[s]=l[s]/2\nans = 0\nfor i in l:\n ans += i\nprint(ans)', 'n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nl[s]=l[s]/2\nans = 0\nfor i in l:\n ans += i\nprint(ans,end="")', 'n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nl[s]=l[s]/2\nans = 0\nfor i in l:\n ans += i\nprint(ans)', 'n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nm = 0\ns = 0\nfor i in l:\n if m<i:\n m = i\n s = l.index(i)\n\nl[s]=l[s]/2\nans = 0\nfor i in l:\n ans += i\nprint(int(ans))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s059686575', 's336047191', 's337422316', 's412749357', 's968010562', 's290588789'] | [3060.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [169, 161, 199, 206, 199, 204] |
p03207 | u846041485 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['4\n4320\n4320\n4320\n4320', 'n = int(input())\ns = [int(input()) for i in range(n)]\nprint(sum(s)-int(max(s)/2))\n'] | ['Wrong Answer', 'Accepted'] | ['s303985332', 's402918873'] | [2940.0, 2940.0] | [17.0, 18.0] | [21, 82] |
p03207 | u846150137 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=range(int(input()))\na=[int(input()) for i in n]\nprint(sum(a)-max(a)/2)', 'n=int(input())\na=[int(input()) for i in n]\nprint(sum(a)-max(a)/2)', 'n=range(int(input()))\na=[int(input()) for i in n]\nprint(sum(a)-max(a)//2)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s593187947', 's999507769', 's999065019'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [72, 65, 73] |
p03207 | u847165882 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\nP=[int(input()) for _ in range(N)]\nP=sorted(P)\nP[N-1]=P[N-1]/2\nprint(int(sum(P))', 'N=int(input())\nP=[int(input()) for _ in range(N)]\nP=sorted(P)\nP[N-1]=P[N-1]/2\nprint(int(sum(P)))'] | ['Runtime Error', 'Accepted'] | ['s226233335', 's515679595'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 96] |
p03207 | u853952087 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['import math\na=int(input())\nb=list(map(int,input().split()))\nprint(sum(b)-int(max(b)/2))', 'a=int(input())\nb=list(map(int,input().split()))\nprint(round(sum(b)-max(b)/2))', 'a=int(input())\nb=list(map(int,input().split()))\nprint(round(sum(b)-max(b)/2))', 'a=int(input())\nb=list(map(int,input().split()))\nprint(int(sum(b)-max(b)/2))', 'import math\na=int(input())\nb=list(map(int,input().split()))\nprint(math.floor(sum(b)-max(b)/2))', 'import math\na=int(input())\nb=list(map(int,input().split()))\nprint(int(sum(b)-max(b)/2))', 'N = int(input())\nP = [int(input()) for _ in range(N)]\nprint(sum(P) - int(max(P) / 2))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s198240673', 's363523844', 's381160469', 's572073476', 's927503295', 's988074063', 's879248214'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0] | [18.0, 20.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [87, 77, 77, 75, 94, 87, 85] |
p03207 | u855380359 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\na = list([input() for i in range(n)])\nz = 0\nfor i in range(n):\n a[i] = int(a[i])\n if a[i] > z:\n z = i+1\n\nprint(sum(a)-a[z]/2)', 'n = int(input())\na = list([input() for i in range(n)])\nz = 0\nax = 0\nfor i in range(n):\n a[i] = int(a[i])\n if a[i] > ax:\n z = i\n ax = a[i]\n \nprint(int(sum(a)-a[z]/2))'] | ['Runtime Error', 'Accepted'] | ['s376673599', 's385702076'] | [9108.0, 9168.0] | [26.0, 24.0] | [147, 192] |
p03207 | u856490050 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\np=[]\nfor i in range(n):\n p.append(int(input()))\n\nm=max(p)\nfor i in range(n):\n if p[i]==m:\n p[i]=int(m)/2\n break\n\nprint(sum(p))\n', 'n=int(input())\np=[]\nfor i in range(n):\n p.append(int(input()))\n\nm=max(p)\nfor i in range(n):\n if p[i]==m:\n p[i]=int(m)/2\n\nprint(sum(p))\n', 'n=input()\np={}\nfor i in range(n):\n p.append(i)=input()\n\nfor i in range(n):\n if p[i]==max(p):\n p[i]=max(p)/2\n\nprint(int(sum(p)))\n', 'n=int(input())\np=[]\nfor i in range(n):\n p.append(int(input()))\n\nm=max(p)\nfor i in range(n):\n if p[i]==m:\n p[i]=int(m)/2\n break\n\nprint(int(sum(p)))\n'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s502294047', 's549166386', 's679598565', 's564636685'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0] | [162, 148, 141, 167] |
p03207 | u857070771 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\np=[]\nfor_ in range(n):\n\tx=int(input())\n\tp.append(x)\nans=sum(p)-(max(p) // 2)\nprint(ans)', 'n=int(input())\np=[]\nfor _ in range(n):\n\tx=int(input())\n\tp.append(x)\nans=sum(p)-(max(p) // 2)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s735084349', 's937775743'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 103] |
p03207 | u857408368 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np_List = list(int(input()) for i in range(N))\nprint(p_List)\nMax = max(p_List)\n\nSum = sum(p_List) - Max / 2\n\nprint(int(Sum))\n\n\n\n\n', 'N = int(input())\np_List = list(int(input()) for i in range(N))\nMax = max(p_List)\n\nSum = sum(p_List) - Max / 2\n\nprint(int(Sum))\n\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s550889915', 's501103669'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 131] |
p03207 | u859897687 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)/2)', 'n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)//2)'] | ['Wrong Answer', 'Accepted'] | ['s578246842', 's524254005'] | [2940.0, 3060.0] | [17.0, 20.0] | [72, 73] |
p03207 | u862296914 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['from sys import stdin\nN = int(input())\nP = sorted([int(p) for p in stdin.read().splitlines()])\n\nprint(P[-1]+sum(P[:-1]))\n\n', 'from sys import stdin\nN = int(input())\nP = sorted([int(p) for p in stdin.read().splitlines()])\n\nprint(P[-1]/2+sum(P[:-1]))\n', 'from sys import stdin\nN = int(input())\nP = sorted([int(p) for p in stdin.read().splitlines()])\n \nprint(int(P[-1]/2)+sum(P[:-1]))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s448736385', 's518689221', 's000238633'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [122, 123, 128] |
p03207 | u865413330 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\nl = [int(input()) for i in range(n)]\nl.sort()\nfor i in l:\n result += i\nprint(result - l[n] / 2)', 'n = int(input())\nl = [int(input()) for i in range(n)]\nl.sort()\ntotal = 0\nfor i in l:\n total += i\nprint(total - int(l[n-1] / 2))'] | ['Runtime Error', 'Accepted'] | ['s832150404', 's604897069'] | [2940.0, 2940.0] | [17.0, 18.0] | [115, 130] |
p03207 | u867849998 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=[int(input()) for i in range(int(input()))]\nprint(sum(i for i in n)-int(max(l)/2))', 'n=[int(input()) for i in range(int(input()))]\n#print(n)\nprint(sum(i for i in n)-int(max(n)/2))'] | ['Runtime Error', 'Accepted'] | ['s360222289', 's120396298'] | [2940.0, 3064.0] | [17.0, 17.0] | [84, 94] |
p03207 | u868040597 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ["#!/usr/bin/python\n\ndef main():\n n = int(input())\n price_list = [int(input()) for i in range(n)]\n price_list.sort()\n price_list[-1] /= 2\n print(sum(price_list))\n\nif __name__ == '__main__':\n main()", "#!/usr/bin/python\n\ndef main():\n n = int(input())\n price_list = [int(input()) for i in range(n)]\n price_list.sort()\n price_list[-1] //= 2\n\n print(sum(price_list))\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s506228153', 's482663421'] | [2940.0, 2940.0] | [18.0, 19.0] | [214, 217] |
p03207 | u868237899 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\nitems = []\nfor _ in range(N):\n item = int(input())\n items.append(item)\n\nitems.sort()\n\nprint(int(sum(items[0:N-1]) + items[N]/2))', 'N = int(input())\nitems = []\nfor _ in range(N):\n item = int(input())\n items.append(item)\n\nitems.sort()\n\nprint(int(sum(items[0:N-1]) + items[-1]/2))'] | ['Runtime Error', 'Accepted'] | ['s641127026', 's930806436'] | [2940.0, 2940.0] | [17.0, 17.0] | [151, 152] |
p03207 | u874885251 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\nprice_list = []\nappend = pricelist.append\nfor i in range(N):\n\tp = int(input)\n append(p)\npricelist.sort(reverse=True)\npricelist[0] = pricelist[0] / 2\nprint(sum(pricelist))', 'N = int(input())\nprice_list = []\nappend = price_list.append\nfor i in range(N):\n p = int(input())\n append(p)\nprice_list.sort(reverse=True)\nprice_list[0] = price_list[0] / 2\nprint(sum(price_list))', 'N = int(input())\nprice_list = []\nappend = price_list.append\nfor i in range(N):\n p = int(input())\n append(p)\nprice_list.sort(reverse=True)\nprice_list[0] = price_list[0] // 2\nprint(sum(price_list))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s239349065', 's517980789', 's661475427'] | [2940.0, 2940.0, 3060.0] | [17.0, 19.0, 17.0] | [190, 200, 201] |
p03207 | u877415670 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\nprint(l[0]//2+sum(l[1:]))', 'n=int(input())\nl=[int(input()) for _ in range(n)]\nl.sort(reverse=True)\nprint(l[0]//2+sum(l[1:]))\n'] | ['Wrong Answer', 'Accepted'] | ['s759732103', 's679827995'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 97] |
p03207 | u882370611 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\np=[input() for i in range(n)]\nprint(sum(p)-int(max(p)/2))', 'n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-int(max(p)/2))'] | ['Runtime Error', 'Accepted'] | ['s392699711', 's086251048'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 77] |
p03207 | u884682365 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = list(int(input()) for i in range(n))\na = p.pop(p.index(max(p))) / 2\nprint(sum(p) + a)', 'n = int(input())\np = list(int(input()) for i in range(n))\na = p.pop(p.index(max(p))) / 2\nprint(int(sum(p) + a))'] | ['Wrong Answer', 'Accepted'] | ['s459037762', 's664959097'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 111] |
p03207 | u887147934 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\np=sorted([int(input()) for i in range(N)])[::-1]\n\nSum=p[0]/2\n\nfor i in range(1,N):\n Sum=Sum+p[i]\n\nprint(Sum)', 'N=int(input())\np=sorted([int(input()) for i in range(N)])[::-1]\n\nSum=p[0]/2\n\nfor i in range(1,N):\n Sum=Sum+p[i]\n\nprint(int(Sum))'] | ['Wrong Answer', 'Accepted'] | ['s349070897', 's345971236'] | [2940.0, 2940.0] | [17.0, 17.0] | [124, 129] |
p03207 | u888610038 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\nA=[int,input() for i in range(n)]\ncnt=0\n\nfor i in range(n):\n cnt+=A[i]\ncnt-=max(A)*0.5\nprint(cnt)', 'n=int(input())\nA=[int(input()) for i in range(n)]\ncnt=0\n\nfor i in range(n):\n cnt+=A[i]\ncnt-=max(A)*0.5\nprint(cnt)', 'n=int(input())\nA=[int(input()) for i in range(n)]\ncnt=0\n\nfor i in range(n):\n cnt+=A[i]\ncnt-=max(A)*0.5\nprint(int(cnt))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s296813067', 's888918611', 's927556278'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [113, 114, 119] |
p03207 | u895536501 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\np=list(map(int,input().split()))\np=sorted(p,reverse=True)\nans=int(p[0]/2)\nfor i in range(1,len(p)):\n ans+=p[i]\nprint(ans)', 'N=int(input())\np=list(map(int,input().split()))\nprint(sum(p)-max(p)//2)', 'N=int(input())\np=[int(input()) for i in range(N)]\nprint(sum(p)-max(p)//2)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s264994980', 's887279633', 's186388085'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [139, 71, 73] |
p03207 | u896430034 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\nS = [int(input()) for _ in range(N)]\n\nA = sorted(S, reverse=True)\n\nS[0] = S[0]/2\n\nprint(int(sum(S)))\n', 'N = int(input())\nS = [int(input()) for _ in range(N)]\n\nA = sorted(S, reverse=True)\n\nS[0] = S[0]/2\n\nprint(sum(int(S))', 'N = int(input())\nS = [int(input()) for _ in range(N)]\n\nA = sorted(S, reverse=True)\n\nS[N-1] = S[N-1]/2\n\nprint(int(sum(S)))\n', 'N = int(input())\nS = [int(input()) for _ in range(N)]\n\nA = sorted(S, reverse=True)\n\nS[0] = S[0]/2\n\nprint(sum(S))', 'N = int(input())\nS = [int(input()) for _ in range(N)]\n\nA = sorted(S, reverse=True)\n\nA[0] = A[0]/2\n\nprint(int(sum(A)))'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s048217431', 's082790341', 's622130107', 's627235039', 's905596051'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0, 17.0, 17.0] | [118, 116, 122, 112, 117] |
p03207 | u896741788 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['l=int(input())\nb=[int(i) for i in range(l)]\nprint(sum(b)-max(b)/2)', 'l=input()\nb=list()\nfor i in range(l)\n a=int(input())\n b.append(a)\nprint(sum(b)-max(b)/2)', 'N=input()\nb={}\nfor i in range(N)\n a=int(input())\n b.append(a)\nprint(sum(b)-max(b)/2)', 'l=int(input())\nb=[int(input()) for i in range(l)]\nprint(sum(b)-max(b)/2)', 'l=input()\nb=[]\nfor i in range(l)\n a=int(input())\n b.append(a)\nprint(sum(b)-max(b)/2)', 'l=int(input())\nb=[int(input()) for i in range(l)]\nprint(int(sum(b)-max(b)/2))'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s288982550', 's362439152', 's363483206', 's882276988', 's979792597', 's270270284'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [66, 94, 90, 72, 90, 77] |
p03207 | u897436032 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['l = [int(input()) for _ in range(int(input))]\nHIGH = max(l)\nprint(sum(l)-int(HIGH//2))', 'l = [int(input()) for _ in range(int(input()))]\nprint(sum(l)-int(max(l))//2)\n'] | ['Runtime Error', 'Accepted'] | ['s008115030', 's347558985'] | [2940.0, 2940.0] | [17.0, 17.0] | [86, 77] |
p03207 | u901098617 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = [int(input()) for i in range(n)]\nans = sum(p) - min(p)//2\nprint(ans)', 'n = int(input())\np = [int(input()) for i in range(n)]\nans = sum(p) - max(p)//2\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s297401629', 's945516694'] | [2940.0, 2940.0] | [18.0, 18.0] | [89, 89] |
p03207 | u903005414 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ["S = input()\nif S[0] != 'A':\n print('WA')\n exit()\nif S[2:].count('C') != 1:\n print('WA')\n exit()\nfor i in range(len(S)):\n if i in [0, 2]:\n if S[i] != S[i].upper():\n print('WA')\n exit()\n continue\n if S[i] != S[i].lower():\n print('WA')\n exit()\nprint('AC')\n", "S = input()\nif S[0] != 'A':\n print('WA')\n exit()\nif S[2:].count('C') != 1:\n print('WA')\n exit()\nfor i in range(len(S)):\n if i in [0, 2]:\n if S[i] != S[i].upper():\n print('WA')\n exit()\n continue\n if S[i] != S[i].lower():\n print('WA')\n exit()\nprint('AC')\n", 'N = int(input())\nP = sorted([int(input()) for _ in range(N)], reverse=True)\nans = sum(P) - P[0] // 2\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s089215479', 's364447385', 's590844424'] | [2940.0, 3060.0, 9136.0] | [17.0, 22.0, 29.0] | [321, 321, 112] |
p03207 | u910295650 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['p=[int(input()) for _ in range(int(input()))]\nans=0\nfor i in range(len(p)):\n ans+=p[i]\nans=ans-max(p)+max(p)/2\nprint(ans)', 'p=[int(input()) for _ in range(int(input()))]\nans=0\nfor i in range(len(p)):\n ans+=p[i]\nans=ans-max(p)+max(p)/2\nprint(int(ans))'] | ['Wrong Answer', 'Accepted'] | ['s534078080', 's834711672'] | [3060.0, 2940.0] | [19.0, 18.0] | [124, 129] |
p03207 | u917140501 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\nA = [int(input()) for _ in range(n)]\n\nA.sort(reverse=True)\nprint(A)\nA[0]=int(A[0]/2)\nprint(sum(A))', 'n=int(input())\nA = [int(input()) for _ in range(n)]\nA.sort(reverse=True)\nA[0]=int(A[0]/2)\nprint(sum(A))'] | ['Wrong Answer', 'Accepted'] | ['s358770873', 's025828997'] | [2940.0, 3060.0] | [18.0, 18.0] | [113, 103] |
p03207 | u919633157 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n,*p,=map(int,open(0).read().split())\np=sorted(p)\nprint(p(max)//2)\n', 'n=int(input())\np=sorted([int(input()) for i in range(n)])\nprint(int(max(p)//2+sum(p[:-1])))\n'] | ['Runtime Error', 'Accepted'] | ['s407769323', 's488306880'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 92] |
p03207 | u922901775 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['3\n4980\n7980\n6980', '# coding: utf-8\n# Your code here!\n\nN = int(input())\np = [int(input()) for n in range(N)]\n\nprint(sum(p) - max(p) // 2)'] | ['Wrong Answer', 'Accepted'] | ['s523992999', 's231898356'] | [2940.0, 2940.0] | [17.0, 17.0] | [16, 117] |
p03207 | u923662841 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N, *p = map(int, open(0).read().split())\np.sort()\nprint(p[:-1].sum() + p[-1]/2)', 'import sys\n\ns = sys.stdin.readline()\nN = s[0]\np = sorted(s[1:])\nprint(p[:-1].sum() + p[-1]/2)', 'N = int(input())\np = [int(input()) for i in range(N)]\np.sort()\nprint(int(sum(p[:-1]) + p[-1]/2))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s262243300', 's346178350', 's381241609'] | [3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [79, 93, 96] |
p03207 | u924467864 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = []\nfor i in range(n):\n p.append(int(input()))\n\np_max = max(p)\n\nprint(sum(p) - p_max / 2)\n', 'n = int(input())\np = []\nfor i in range(n):\n p.append(int(input()))\n\np_max = max(p)\n\nprint(int(sum(p) - p_max / 2)\n', 'n = int(input())\np = []\nfor i in range(n):\n p.append(int(input()))\n\np_max = max(p)\n\nprint(int(sum(p) - p_max / 2))\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s152400935', 's972009842', 's234534717'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [113, 117, 118] |
p03207 | u927282564 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\nprice=[]\nfor i in range(n):\n price.append(int(input()))\n \nprice=sorted(price)\n\nprice[-1]=price[-1]/2\n\nprint(sum(price))\n ', 'n=int(input())\nprice=[]\nfor i in range(n):\n price.append(int(input()))\n \nprice=sorted(price)\n\nprice[-1]=price[-1]/2\n\nprint(int(sum(price)))\n \n'] | ['Wrong Answer', 'Accepted'] | ['s602534705', 's525304837'] | [2940.0, 2940.0] | [18.0, 18.0] | [139, 145] |
p03207 | u928784113 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['# -*- coding: utf-8 -*-\nN = int(input())\na = [input() for i in range(N)]\nS = max(a) // 2\na.remove(max(a)) \nprint(sum(a,S)) ', '# -*- coding: utf-8 -*-\nN = int(input())\na = [input() for i in range(N)]\ns = int(max(a)) // 2\na.remove(max(a)) \nprint(sum(a) + s) ', '# -*- coding: utf-8 -*-\nN = int(input())\na = [int(input()) for i in range(N)]\ns = int(max(a)) // 2\na.remove(max(a)) \nprint(sum(a) + s) '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s304697168', 's766591807', 's920633122'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [197, 204, 209] |
p03207 | u932913455 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['import numpy as np\n\nN = int(input())\nprice = []\n\nfor i in range(N):\n price.append(int(input()))\n\nprice = np.array(price)\nmax_index = np.argmax(price)\n\nprint(int(np.sum(price) - price[max_index] / 2', 'import numpy as np\n\nN = int(input())\nprice = []\n\nfor i in range(N):\n price.append(int(input()))\n\nprice = np.array(price)\nmax_index = np.argmax(price)\n\nprint(int(np.sum(price) - price[max_index] / 2))\n'] | ['Runtime Error', 'Accepted'] | ['s719479264', 's730281082'] | [2940.0, 18572.0] | [18.0, 261.0] | [200, 203] |
p03207 | u945945701 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in input:\n nums.append(input)\n if(input > max):\n max = input\nfor x in range (1,len(nums)):\n total +=x\nprint(total - max + max/2) \n \n', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in range(input):\n nums.append(int(input()))\n if(input > max):\n max = input\n total += input\nprint(total-max + max/2)\n', 'aaa = int(input())\nl = []\nfor x in range(aaa):\n l.append(int(input()))\n \nprint(int(sum(l) - max(l) + max(l/2)))', 'input = int(input())\nnums = []\nfor _ in range(input):\n nums.append(int(input()))\nprint(0)\n', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in range(input):\n nums.append(input)\n if(input > max):\n max = input\nfor x in range (1,len(nums)):\n total +=x\nprint(total - max + max/2) \n ', 'input = int(input())\nnums = []\nfor x in range(input):\n nums.append(int(input()))\nprint(sum(nums))', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in input:\n nums.append(int(input()))\n if(input > max):\n max = input\nfor x in range (1,len(nums)):\n total +=x\nprint(total - max + max/2) \n ', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in range(input):\n nums.append(int(input()))\nprint(sum(nums)-max(nums) + max(nums)/2)', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in range(input):\n nums.append(int(input()))\nprint(int(sum(nums)-max(nums) + max(nums)/2))', 'input = int(input())\nnums = []\nmax = 0\ntotal = 0\nfor x in range(input):\n nums.append(int(input()))\n if(input > max):\n max = input\nprint(sum(nums)-max + max/2)', 'input =int(input())\nl = []\nfor x in range(input):\n l.append(int(input()))\n \nans = int(sum(l) -max(l)/2)\nprint(ans)\n', 'N =int(input())\nl = []\nfor x in range(N):\n l.append(int(input()))\n \nans = int(sum(l) -max(l)/2)\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s172600011', 's175829483', 's254244911', 's318992216', 's354759119', 's408690952', 's426694922', 's650040931', 's823112200', 's842593835', 's996650625', 's202330184'] | [2940.0, 2940.0, 2940.0, 3316.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 21.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0] | [194, 177, 113, 91, 200, 98, 200, 140, 145, 163, 117, 108] |
p03207 | u946424121 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\nl = [int(input()) for i in range(n)].sort()\nprint(int(0.5*l[-1] + sum(l[-1])))', 'n = int(input())\nl = list()\nfor i in range(n):\n a = int(input())\n l.append(a)\n\nl.sort()\np = 0.5*l[-1] + sum(l[:-1])\nprint(int(p))\n'] | ['Runtime Error', 'Accepted'] | ['s952098381', 's792638879'] | [3060.0, 2940.0] | [20.0, 17.0] | [95, 132] |
p03207 | u955248595 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\nP = sorted([int(input()) for X in range(0,N)])\nP[-1] = P[-1]//2\nprint(sum(SP))', 'N = int(input())\nP = sorted([int(input()) for X in range(0,N)])\nP[-1] = P[-1]//2\nprint(sum(P))'] | ['Runtime Error', 'Accepted'] | ['s297281753', 's489732391'] | [9068.0, 9068.0] | [25.0, 25.0] | [95, 94] |
p03207 | u956092408 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = input()\nN = int(N)\n\np = []\nfor i in range(N):\n d = input()\n d = int(d)\n p.append(d)\n\n\nprint(max(p)/2+sum(p)-max(p))\n', 'N = input()\nN = int(N)\n\np = []\nfor i in range(N):\n d = input()\n d = int(d)\n p.append(d)\n\n\nprint(int(max(p)/2+sum(p)-max(p)))\n'] | ['Wrong Answer', 'Accepted'] | ['s465707747', 's088359726'] | [2940.0, 3064.0] | [18.0, 17.0] | [129, 134] |
p03207 | u957084285 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = [int(input()) for _ in range(n)]\nprint(p.sum() - p.max()//2)', 'n = int(input())\np = [int(input()) for _ in range(n)]\nprint(sum(p) - max(p)//2)'] | ['Runtime Error', 'Accepted'] | ['s479551038', 's020893493'] | [2940.0, 2940.0] | [18.0, 19.0] | [81, 79] |
p03207 | u958612488 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\nlist_p=[]\nfor i in range(N):\n list_p.append(int(input()))\n\nprint(sum(list_p)-max(list_p)/2)', 'N=int(input())\nlist_p=[]\nfor i in range(N):\n list_p.append(int(input()))\n\nprint(int(sum(list_p)-max(list_p)/2))'] | ['Wrong Answer', 'Accepted'] | ['s026682956', 's772808230'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 114] |
p03207 | u959236700 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = input()\np = []\nfor i in range(N):\n p.append(input())\n\nprint(sum(p)-max(p)//2)\n\n', 'N = input()\np = []\nfor i in range(N):\n p.append(int(input()))\n\nprint(sum(p)-max(p)//2)\n\n', 'N = int(input())\np = []\nfor i in range(N):\n p.append(int(input()))\n\nprint(sum(p)-max(p)//2)\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s562004221', 's968155624', 's670552470'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [86, 91, 96] |
p03207 | u959759457 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\np=[int(input()) for i in range(N)]\np.sort(reverse=True)\np[0]=0.5*p[0]\ns=sum(p)\nprint(s)', 'N=int(input())\np=[int(input()) for i in range(N)]\np.sort(reverse=True)\np[0]=0.5*p[0]\ns=sum(p)\nprint(int(s))'] | ['Wrong Answer', 'Accepted'] | ['s432962115', 's555446764'] | [3064.0, 2940.0] | [25.0, 17.0] | [102, 107] |
p03207 | u960570220 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = []\n\nfor i in range(N):\n p.append(int(input()))\n\ntotal_price = max(N) / 2 + sum(N) - max(N)\n\nprint(total_price)', 'import math\nN = int(input())\np = []\n\nfor i in range(N):\n p.append(int(input()))\n\ntotal_price = max(N) / 2 + sum(N) - max(N)\n\nprint(math.floor(total_price))', 'N = int(input())\np = list(map(int, input().split()))\n\ntotal_price = (max(N) / 2) + (sum(N) - max(N))\n\nprint(total_price)', 'import math\nN = int(input())\np = []\n\nfor i in range(N):\n p.append(int(input()))\n\ntotal_price = max(p) / 2 + sum(p) - max(p)\n\nprint(math.floor(total_price))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s094865237', 's492248825', 's909379066', 's604193192'] | [9024.0, 9028.0, 9108.0, 8972.0] | [25.0, 24.0, 29.0, 23.0] | [134, 158, 120, 158] |
p03207 | u960947353 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['from sys import stdin\na = stdin.readline().rstrip()\nw=int(a)\nj=1\nsumvalue=0\nmaxvalue=0\nwhile j<=w:\n a = stdin.readline().rstrip()\n sumvalue+=int(a)\n maxvalue=max(maxvalue,int(a))\nprint(sumvalue-int(maxvalue/2))', "from sys import stdin\na = stdin.readline()\nw=int(a)\nj=1\nsumvalue=0\nmaxvalue=0\nw2=[]\nwhile j<=w:\n z = stdin.readline().rstrip('\\n')\n sumvalue+=int(z)\n maxvalue=max(maxvalue,int(z))\n j+=1\nprint(sumvalue-int(maxvalue/2))"] | ['Runtime Error', 'Accepted'] | ['s362078583', 's908159570'] | [3060.0, 3060.0] | [18.0, 20.0] | [219, 229] |
p03207 | u963903527 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = input(); l=sorted([int(input()) for _ in range(n)])\nprint(int(sum(l)-l[-1]/2))', 'n = int(input()); l=sorted([int(input()) for _ in range(n)])\nprint(int(sum(l)-l[-1]/2))'] | ['Runtime Error', 'Accepted'] | ['s273330710', 's560944562'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 87] |
p03207 | u967835038 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\nl=[]\nfor _ in range(n):\n l.append(int(iｂnput()))\nprint(sum(l)-int(max(l)/2))\n', 'n=int(input())\nl=[]\nfor _ in range(n):\n l.append(int(input()))\nprint(sum(l)-int(max(l)/2))\n'] | ['Runtime Error', 'Accepted'] | ['s206654860', 's876066017'] | [2940.0, 2940.0] | [17.0, 18.0] | [97, 94] |
p03207 | u969848070 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = []\nfor i in range(n):\n p[i]= int(input())\np.sort()\nprint(p[-1]//2 + sum(p[:-2]))', 'n = int(input())\np = [0] * n\nfor i in range(n):\n p[i]= int(input())\np.sort()\nprint(p[-1]//2 + sum(p[:-1]))'] | ['Runtime Error', 'Accepted'] | ['s978915989', 's081230563'] | [9020.0, 9048.0] | [26.0, 25.0] | [102, 107] |
p03207 | u970899068 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n=int(input())\ns=[list(map(int,list(input()))) for i in range(h)]\n\nprint(sum(s)-1/2max(s))', 'n=int(input())\ns=[int(input()) for i in range(n)]\n \nprint(sum(s)-max(s)//2)'] | ['Runtime Error', 'Accepted'] | ['s218544445', 's735366069'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 75] |
p03207 | u977646790 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['import math\nN=int(input())\np=[int(input()) for x in range(N)]\np.sort(reverse = True)\np[0]=p[0]/2\nmath.floor(sum(p))', 'import math\nN=int(input())\np=[int(input()) for i in range(N)]\npo=sum(p)-max(p)/2\nmath.floor(po)', 'N=int(input())\np=[int(x) for x in input().split()]\np.sort(reverse = True)\np[0]=p[0]/2\nprint(sum(p))', 'N=int(input())\np=[int(input()) for i in range(N)]\nprint(sum(p)-max(p)/2)', 'import math\nN=int(input())\np=[int(input()) for i in range(N)]\npo=sum(p)-max(p)/2\nprint(math.floor(po))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s014959747', 's080353692', 's258180651', 's497580534', 's543881144'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 19.0, 18.0, 18.0, 18.0] | [115, 95, 99, 72, 102] |
p03207 | u981767024 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['# 2019/02/02\n\n\n# Input\nn = int(input())\np = list()\nmax = 0\nsum = 0\n\n# Input and sum\nfor i in range(n):\n p.append(int(input()))\n if max < p[i]:\n max = p[i]\n sum += p[i]\n\nprint(sum)\nsum -= int(max / 2)\n\n# Output\nprint(sum)\nprint(p)', '# 2019/02/02\n\n\n# Input\nn = int(input())\np = list()\nmax = 0\nsum = 0\n\n# Input and sum\nfor i in range(n):\n p.append(int(input()))\n if max < p[i]:\n max = p[i]\n sum += p[i]\n\nsum -= int(max / 2)\n\n# Output\nprint(sum)\n'] | ['Wrong Answer', 'Accepted'] | ['s314509855', 's382541735'] | [3060.0, 3060.0] | [19.0, 18.0] | [278, 259] |
p03207 | u982594421 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\nsum = 0\ndiscount = 0\nfor _ in range(n):\n p = int(input())\n sum += p\n discount = max(discount, p // 2)\n\nprint(max - discount)\n', 'n = int(input())\nans = 0\nd = 0\nfor _ in range(n):\n p = int(input())\n ans += p\n d = max(d, p // 2)\n\nprint(ans - d)\n'] | ['Runtime Error', 'Accepted'] | ['s441438868', 's012657774'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 123] |
p03207 | u985735467 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N=int(input())\nList = [int(input()) for i in range(N)]\nprint(sum(List)-(max(List)/2))', 'N=int(input())\nList = [int(input()) for i in range(N)]\nprint(int(sum(List)-(max(List)/2)))'] | ['Wrong Answer', 'Accepted'] | ['s274171472', 's222955382'] | [2940.0, 2940.0] | [17.0, 17.0] | [85, 90] |
p03207 | u989817703 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\np = [int(input()) for i in range(N)]\nA = 0\nmax=99\n\nfor i in range(N):\n if p[i] > max:\n max = p[i]\n m = i\n\np[m] = p[m]/2\n\n\nfor i in range(N):\n A += p[i]\n\nprint(A) ', 'N = int(input())\np = int([input() for i in range(N)])\nmax=100\n\nfor i in range(N):\n if p(i) > max:\n max=p(i)\n m=i\n\np(m) = p(m)/2\n\nfor i in range(N):\n A += p(i)\n\nprint(A) ', 'N = int(input())\np = [int(input()) for i in range(N)]\nA = 0\nmax=99\n\nfor i in range(N):\n if p[i] > max:\n max = p[i]\n m = i\n\np[m] = p[m]/2\n\n\nfor i in range(N):\n A += p[i]\n\nprint(int(A)) '] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s019760673', 's439447932', 's842035498'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [201, 190, 206] |
p03207 | u996952235 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['n = int(input())\np = []\nfor i in range(n):\n p.append(int(input()))\n \nprint(sum(p) - max(p)/2)', 'n = int(input())\np = []\nfor i in range(n):\n p.append(int(input()))\n \nprint(sum(p) - max(p)//2)'] | ['Wrong Answer', 'Accepted'] | ['s806428582', 's597315869'] | [2940.0, 2940.0] | [19.0, 18.0] | [95, 96] |
p03207 | u999893056 | 2,000 | 1,048,576 | In some other world, today is the day before Christmas Eve. Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan). He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay? | ['N = int(input())\n\np = [int(input()) for _ in range(N)]\nmp = max(p)\nprint(mp+ p[i] for i in range(len(p)))', 'N = int(input())\np = [int(input()) for _ in range(N)]\nprint(sum(p) - int(max(p)/2))'] | ['Wrong Answer', 'Accepted'] | ['s368932064', 's230398518'] | [2940.0, 2940.0] | [19.0, 17.0] | [105, 83] |
p03208 | u000623733 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N, K = map(int, input().split())\nh_list = []\nfor _ in range(N):\n h_list.append(int(input()))\nh_list.sort()\n\nerr_list = [h_list[i+K-1] - h_list[i] for i in range(N-K+1)]\nprint(max(err_list))\n', 'N, K = map(int, input().split())\nh_list = []\nfor _ in range(N):\n h_list.append(int(input()))\nh_list.sort()\n\nerr_list = [h_list[i+K-1] - h_list[i] for i in range(N-K+1)]\nprint(min(err_list))\n'] | ['Wrong Answer', 'Accepted'] | ['s466630185', 's316481873'] | [11164.0, 11288.0] | [237.0, 237.0] | [193, 193] |
p03208 | u001024152 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N,K = map(int, input().split())\nhs = []\nfor _ in range(N):\n h = int(input())\n hs.append(h)\nhs.sort()\nprint(hs)\nans = 1e9\nfor i in range(N-K+1):\n ans = min(ans, abs(hs[i]-hs[i+K-1]))\nprint(ans)', 'N,K = map(int, input().split())\nhs = []\nfor _ in range(N):\n h = int(input())\n hs.append(h)\nhs.sort()\n# print(hs)\nans = 1e9\nfor i in range(N-K+1):\n ans = min(ans, abs(hs[i]-hs[i+K-1]))\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s926697356', 's314477731'] | [10520.0, 7488.0] | [267.0, 263.0] | [201, 203] |
p03208 | u002459665 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = [int(i) for i in input().split()]\nhs = []\nfor i in range(n):\n hs.append(int(input()))\n\nhs.sort()\nprint(hs)\n\nmin_diff = hs[k - 1] - hs[0]\nfor i in range(n - k + 1):\n diff = hs[i + k - 1] - hs[i]\n if diff == 0:\n min_diff = 0\n break\n\n if diff < min_diff:\n min_diff = diff\n\nprint(min_diff)\n', 'n, k = [int(i) for i in input().split()]\nhs = []\nfor i in range(n):\n hs.append(int(input()))\n\nhs.sort()\n# print(hs)\n\nmin_diff = hs[k - 1] - hs[0]\nfor i in range(n - k + 1):\n diff = hs[i + k - 1] - hs[i]\n if diff == 0:\n min_diff = 0\n break\n\n if diff < min_diff:\n min_diff = diff\n\nprint(min_diff)\n'] | ['Wrong Answer', 'Accepted'] | ['s640599944', 's567853478'] | [10520.0, 7512.0] | [261.0, 255.0] | [326, 328] |
p03208 | u006883624 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['def main():\n\tN, K = [int(v) for v in input().split()]\n \n H = sorted([-int(input() for _ in range(N)])\n \n print(-H[0] + H[K - 1])\n \nmain()\n\n', 'def main():\n N, K = [int(v) for v in input().split()]\n H = sorted([-int(input()) for _ in range(N)])\n\n min_diff = 10 ** 10\n for i in range(K - 1, N):\n min_diff = min(min_diff, -H[i - K + 1] + H[i])\n print(min_diff)\n\nmain()\n\n'] | ['Runtime Error', 'Accepted'] | ['s702188631', 's179737762'] | [2940.0, 8280.0] | [17.0, 242.0] | [154, 246] |
p03208 | u013408661 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['import sys\nn,k=map(int,input().split())\nh=[int(i) for i in sys.stdin]\nh.sort()\ns=[0]\nfor i in range(n-1):\n s.append(h[i+1]-h[i])\nans=[sum(h[:k])]\nfor i in range(n-k):\n ans.append(ans[-1]+s[i+k]-s[i])\nprint(min(ans))', 'import sys\nn,k=map(int,input().split())\nh=[int(i) for i in sys.stdin]\nh.sort()\ns=[0]\nfor i in range(n-1):\n s.append(h[i+1]-h[i])\nans=[sum(s[:k])]\nfor i in range(n-k):\n ans.append(ans[-1]+s[i+k]-s[i+1])\nprint(min(ans))'] | ['Wrong Answer', 'Accepted'] | ['s227876556', 's596344706'] | [15176.0, 15128.0] | [146.0, 150.0] | [217, 219] |
p03208 | u013756322 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ["N, K, *H = map(int, open(0).read().split())\nH.sort()\na=float('inf')\nfor i in range(N-K+1):\n a=min(a,H[i+k-1]-H[i])\nprint(a)", 'N,K,*H = map(int,open(0).read().split())\nH.sort()\na=10**9\nfor i in range(N-K+1):\n a=min(a, H[i+K-1]-H[i])\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s894462079', 's821200970'] | [14092.0, 14092.0] | [78.0, 120.0] | [126, 117] |
p03208 | u016901717 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k=map(int,input().split())\nH=sorted([int(input()) for i in range(n)])\nprint(min([h[i+k-1]-h[i] for i in range(n-k+1)]))\n', 'n,k=map(int,input().split())\nh=sorted([int(input()) for i in range(n)])\nprint(min([h[i+k-1]-h[i] for i in range(n-k+1)]))\n'] | ['Runtime Error', 'Accepted'] | ['s404623398', 's601714295'] | [8256.0, 10872.0] | [222.0, 238.0] | [122, 122] |
p03208 | u018017456 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N, K = input().split()\nN = int(N)\nK = int(K)\na = [int(input()) for i in range(N)]\n\na.sort()\nprint(a)\n\nprint(min([a[i+K-1]-a[i] for i in range(N-K+1)]))', 'N, K = input().split()\nN = int(N)\nK = int(K)\na = [int(input()) for i in range(N)]\n\na.sort()\n\n\nprint(min([a[i+K-1]-a[i] for i in range(N-K+1)]))'] | ['Wrong Answer', 'Accepted'] | ['s618001768', 's403220056'] | [11900.0, 11216.0] | [244.0, 227.0] | [151, 143] |
p03208 | u020390084 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = map(int,input().split())\nh = [int(input()) for _ in range(n)]\nh.sort()\nbetween = [h[i+1]-h[i] for i in range(n-1)]\nanswer = 10**9\nfor i in range(1,n-1):\n between[i] += between[i-1]\n\nfor i in range(n-k):\n answer = min(answer, between[i+k-1]-between[i])\n \nprint(answer)', 'n, k, *h = map(int, open(0).read().split())\nh.sort()\nans = 10e9+7\nfor i in range(n-k+1):\n\tans = min(ans, h[i+k-1]-h[i])\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s549015422', 's587690702'] | [11216.0, 14092.0] | [276.0, 114.0] | [277, 131] |
p03208 | u021548497 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = map(int, input().split())\na = [0]*n\nfor i in range(n):\n a[i] = int(input())\n\na.sort()\n\nans = a[-1]-a[0]\nfor i in range(n-k+1):\n if ans > a[i+k-1]-a[i]:\n ans = a[i+k]-a[i]\n\nprint(ans)', 'n, k = map(int, input().split())\nh = []\nfor _ in range(n):\n h.append(int(input()))\n\nh.sort()\nans = []\nfor i in range(n-k+1):\n ans.append(h[i+k-1]-h[i])\nprint(max(ans))', 'n, k = map(int, input().split())\na = [0]*n\nfor i in range(n):\n a[i] = int(input())\n\na.sort()\n\nans = a[-1]-a[0]\nfor i in range(n-k+1):\n if ans > a[i+k-1]-a[i]:\n ans = a[i+k-1]-a[i]\n\nprint(ans)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s894539705', 's955609965', 's677117109'] | [7472.0, 11292.0, 7472.0] | [252.0, 247.0, 237.0] | [194, 173, 196] |
p03208 | u024782094 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k=map(int,input().split())\nh=[input() for _ in range(n)]\nh=sorted(h)\nl=[]\nfor i in range(n-k+1):\n l.append(h[i+k-1]-h[i])\nprint(min(l))', 'n,k=map(int,input().split())\nh=[int(input()) for _ in range(n)]\nh=sorted(h)\nl=[]\nfor i in range(n-k+1):\n l.append(h[i+k-1]-h[i])\nprint(min(l))'] | ['Runtime Error', 'Accepted'] | ['s694510130', 's294962268'] | [11352.0, 10892.0] | [203.0, 228.0] | [138, 143] |
p03208 | u029234056 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N,K=map(int,input().split(" "))\nH=[int(input()) for _ in range(N)]\nH.sort()\ntmax=10**9\nfor a in range(N-K+1):\n h1,h2=H[a],H[a+K]\n tmax=min(tmax,abs(h1-h2))\n if(tmax==0):\n break\nprint(tmax)', 'N,K=map(int,input().split())\nH=[int(input()) for _ in range(N)]\nH.sort()\ntmp=H[K-1]-H[0]\nfor i in range(0,N-K+1):\n if tmp>H[K+i-1]-H[i]:\n tmp=H[K+i-1]-H[i]\nprint(tmp)'] | ['Runtime Error', 'Accepted'] | ['s199628210', 's163334247'] | [7384.0, 7384.0] | [248.0, 221.0] | [204, 176] |
p03208 | u046187684 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['ef solve(string):\n n, k = map(int, string.split("\\n")[0].split(" "))\n ins = list(map(int, string.split("\\n")[1:]))\n ins.sort()\n return str(min([ins[i + k - 1] - ins[i] for i in range(len(ins) - k + 1)]))\n\n\nif __name__ == \'__main__\':\n n, k = map(int, input().split(" "))\n ins = [input() for _ in range(n)]\n print(solve("{} {}\\n{}".format(n, k, "\\n".join(ins))))\n\n', 'def solve(string):\n n, k = map(int, string.split("\\n")[0].split(" "))\n ins = list(map(int, string.split("\\n")[1:]))\n ins.sort()\n return str(min([ins[i + k - 1] - ins[i] for i in range(len(ins) - k + 1)]))\n\n\nif __name__ == \'__main__\':\n n, k = map(int, input().split(" "))\n ins = [input() for _ in range(n)]\n print(solve("{} {}\\n{}".format(n, k, "\\n".join(ins))))\n'] | ['Runtime Error', 'Accepted'] | ['s287056790', 's520667493'] | [2940.0, 22292.0] | [17.0, 211.0] | [383, 383] |
p03208 | u048945791 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N, K = map(int, input().split())\nh = [int(input()) for _ in range(N)]\n\nh.sort()\n\nans = float("inf")\n\nfor i in range(K, N):\n\tans = min(ans, h[i] - h[i - K])\n\nprint(ans)', 'N, K = map(int, input().split())\nh = [int(input()) for _ in range(N)]\n\nh.sort()\n\nans = float("inf")\n\nfor i in range(K - 1, N):\n\tans = min(ans, h[i] - h[i - K + 1])\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s874263261', 's004158213'] | [7384.0, 7384.0] | [235.0, 251.0] | [167, 175] |
p03208 | u054471580 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['import sys\nn=input()\nlist = n.split(" ")\nn=int(list[0])\nk=int(list[1])\n\ntrees = []\nfor i in range(n):\n trees.append(int(input()))\n\nans=sys.maxsize\nflag=0\ntemp = []\n\nfor i in range(len(trees)-k+1):\n for roop in range(k-1):\n temp.append(trees[i+roop])\n if(flag==1):\n break\n for j in range(i+k-1,len(trees)):\n temp.append(trees[j])\n diff = max(temp) - min(temp)\n if(diff==0):\n ans=0\n flag=1\n break\n if(ans>diff):\n ans=diff\n del temp[k-1]\n temp.clear()\n\nprint(ans)', 'import sys\nn=input()\nlist = n.split(" ")\nn=int(list[0])\nk=int(list[1])\n\ntrees = []\nfor i in range(n):\n trees.append(int(input()))\n\ndef merge_sort(alist):\n if len(alist) <= 1:\n return alist\n \n mid = int(len(alist)/2)\n left = alist[:mid]\n right = alist[mid:]\n \n left = merge_sort(left)\n right = merge_sort(right)\n \n return merge(left, right)\n\ndef merge(left,right):\n sorted_list = []\n left_index = 0\n right_index = 0\n \n while left_index < len(left) and right_index < len(right):\n if left[left_index] >= right[right_index]:\n sorted_list.append(left[left_index])\n left_index += 1\n else:\n sorted_list.append(right[right_index])\n right_index += 1\n \n if left:\n sorted_list.extend(left[left_index:])\n \n if right:\n sorted_list.extend(right[right_index:])\n \n return sorted_list\n\ntrees = merge_sort(trees)\n\nans=sys.maxsize\nflag=0\ntemp = []\n\nfor i in range(len(trees)-k+1):\n diff = trees[i]-trees[i+k-1]\n if(diff==0):\n ans=0\n break\n if(ans>diff):\n ans=diff\n temp.clear()\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s130277380', 's699453812'] | [7836.0, 9372.0] | [2104.0, 829.0] | [524, 1050] |
p03208 | u055941944 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k=map(int,input().split())\nh=list(int(input())for i in range(n))\nh.sort()\nl=[]\nfor i in range(n-k+1):\n l.append(h[k-i+1]-h[i])\n\n\nprint(min(h))\n', 'n, k = map(int,input().split())\nh = []\nfor i in range(n):\n\th.append(int(input()))\nh.sort()\n\nans_l = []\nfor i in range(n-k+1):\n\tans_l.append(ans_l[i+k-1] - ans_l[i])\nprint(min(ans_l))', 'n,k=map(int,input().split())\nh=list(int(input())for i in range(n))\nh.sort()\nl=[]\nfor i in range(n-k+1):\n l.append(h[k-i+1]-h[i])\n\n\nprint(min(l))\n', 'n, k = map(int,input().split())\nlis = []\nfor i in range(n):\n\th = int(input())\n\tlis.append(h)\nlis.sort()\ndiff = []\nfor j in range(n-k+1):\n\tdiff.append(lis[j+k-1] - lis[j])\nprint(min(diff))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s217897233', 's243376287', 's834556157', 's813645637'] | [11176.0, 7384.0, 11296.0, 11292.0] | [241.0, 230.0, 243.0, 260.0] | [148, 182, 148, 187] |
p03208 | u057993957 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = list(map(int, input().split()))\nh = [int(input()) for i in range(n)]\n\nh.sort()\n\nans = 1e+12\nfor i in range(k, n-k+1):\n ans = min(ans, h[i] - h[i-k])\n \nprint(ans)\n', 'n, k = list(map(int, input().split()))\nh = [int(input()) for i in range(n)]\nh = sorted(h)\n\nmins = 10000000000\nfor i in range(n - k+1):\n cost = max(h[i:i+k]) - min(h[i:i+k])\n if cost < mins:\n mins = cost\n \nprint(cost)', 'n, k = list(map(int, input().split()))\nh = [int(input()) for i in range(n)]\nh.sort()\n\nans = 1e+12\nfor i in range(k-1, n):\n ans = min(ans, h[i] - h[i-k+1])\n \nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s357028407', 's395394323', 's484716697'] | [7384.0, 8200.0, 7444.0] | [243.0, 2104.0, 247.0] | [171, 224, 170] |
p03208 | u060938295 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['# -*- coding: utf-8 -*-\n"""\nCreated on Wed Jan 2 09:59:01 2019\n\n@author: Yamazaki Kenichi\n"""\n\nN,K = map(int, input().split())\nh = [int(input()) for i in range(N)]\n\nh.sort()\n\nans = h[K-1] - h[0]\n\nfor i in range(N-K+1):\n temp = h[K-1+i] - h[0+i]\n ans = min(ans,temp)\n print(temp)\nprint(ans)\n', '# -*- coding: utf-8 -*-\n"""\nCreated on Wed Jan 2 09:59:01 2019\n\n@author: Yamazaki Kenichi\n"""\n\nN,K = map(int, input().split())\nh = [int(input()) for i in range(N)]\n\nh.sort()\n\nans = h[K-1] - h[0]\n\nfor i in range(N-K):\n temp = h[K-1+i] - h[0+i]\n ans = min(ans,temp)', '# -*- coding: utf-8 -*-\n"""\nCreated on Wed Jan 2 09:59:01 2019\n\n@author: Yamazaki Kenichi\n"""\n\nN,K = map(int, input().split())\nh = [int(input()) for i in range(N)]\n\nh.sort()\n\nans = h[K-1] - h[0]\n\nfor i in range(N-K+1):\n temp = h[K-1+i] - h[0+i]\n ans = min(ans,temp)\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s244627385', 's334531536', 's221212147'] | [7888.0, 7384.0, 7384.0] | [320.0, 262.0, 245.0] | [297, 268, 282] |
p03208 | u062459048 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = map(int, input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\n\nh.sort()\n \nans = []\nfor i in range(n-k+1):\n ans.append(h[i+k-1]-h[i])\n \nprint(min(h))\n \n\n\n\n', 'n, k = map(int, input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\n\nh.sort()\n \nans = []\nfor i in range(n-k+1):\n ans.append(h[i+k]-h[i])\n \nprint(min(h))\n \n\n\n\n', 'n, k = map(int, input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\n\nh.sort()\n \nans = []\nfor i in range(n-k+1):\n ans.append(h[i+k-1]-h[i])\n \nprint(min(ans))\n \n\n\n\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s275481884', 's701157488', 's105315457'] | [11288.0, 11272.0, 11292.0] | [257.0, 242.0, 248.0] | [180, 178, 182] |
p03208 | u062847046 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N, K = map(int,input().split())\nh_list = [int(input()) for _ in range(N)]\n\nh_list.sort(reverse = True)\ndiff = [h_list[i] - h_list[i+K-1] for i in range(N-K+1)]\nmin(diff)', 'N, K = map(int,input().split())\nh_list = [int(input()) for _ in range(N)]\n\nh_list.sort(reverse = True)\ndiff = [h_list[i] - h_list[i+K-1] for i in range(N-K+1)]\nprint(min(diff))'] | ['Wrong Answer', 'Accepted'] | ['s403426100', 's487396424'] | [11272.0, 11288.0] | [243.0, 222.0] | [169, 176] |
p03208 | u063052907 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['# coding: utf-8\nimport itertools\nimport sys\n\nN, K = map(int, input().split())\n# lst = [int(input()) for _ in range(N)]\nlst = [int(i) for i in sys.stdin]\n# lst2 = list(itertools.combinations(lst, K))\n# print(lst2)\n\nlst3 = []\n# for l in lst2:\nfor l in itertools.combinations(lst, K):\n print(l)\n diff = max(l)-min(l)\n lst3.append(diff)\n\nprint(min(lst3))', '# coding: utf-8\nN, K = map(int, input().split())\nlst = sorted([int(input()) for _ in range(N)], reverse=True)\n\nans = 10000000000\nfor i in range(N-K+1):\n l = lst[i]-lst[i+K-1]\n if l < ans:\n ans = l\nprint(ans)\n\n'] | ['Runtime Error', 'Accepted'] | ['s534144635', 's166089213'] | [143948.0, 8276.0] | [2108.0, 228.0] | [359, 222] |
p03208 | u068142202 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k = map(int, input().split())\ntrees = [int(input()) for _ in range(n)]\ntrees.sort()\ndiff_trees_height = []\nprint(trees)\nfor i in range(n - (k - 1)):\n diff = abs(trees[i] - trees[i + k - 1])\n diff_trees_height.append(diff)\nprint(diff_trees_height)\nprint(min(diff_trees_height))\n', 'n, k = map(int, input().split())\ntrees = [int(input()) for _ in range(n)]\ntrees.sort()\ndiff_trees_height = []\n\nfor i in range(n - (k - 1)):\n diff = abs(trees[i] - trees[i + k - 1])\n diff_trees_height.append(diff)\nprint(min(diff_trees_height))\n'] | ['Wrong Answer', 'Accepted'] | ['s452976753', 's463593233'] | [17812.0, 17144.0] | [198.0, 193.0] | [286, 249] |
p03208 | u069035678 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n=input().split()\nn=[int(i) for i in n]\nh=[]\nfor i in range(n[0]):\n h.append(int(input()))\nh.sort()\n\nq=-1\nfor i in range(len(h)):\n a=h[i+n[1]-1]-h[i]\n if q==-1 or q>a:\n q=a\n if q==0:\n break\nprint(q)', 'n=input().split()\nn=[int(i) for i in n]\nh=[]\nfor i in range(n[0]):\n h.append(int(input()))\nh.sort()\n\nq=-1\nfor i in range(len(h)):\n if q==-1 or q>h[i+n[1]-1]-h[i]:\n q=h[i+n[1]-1]-h[i]\n if q==0:\n break\nprint(q)', '=input().split()\nn=[int(i) for i in n]\nh=[n[1]]\nfor i in range(n[0]):\n h[i]=int(input())\nh.sort()\n\nq=-1\nfor i in range(len(h)):\n a=h[i+n[1]-1]-h[i]\n if q==-1 or q>a:\n q=a\n if q==0:\n break\nprint(q)', 'n=input().split()\nn=[int(i) for i in n]\nh=[0]*n[0]\nfor i in range(n[0]):\n h[i]=int(input())\nh.sort()\n\nq=-1\nfor i in range(len(h)-n[1]):\n a=h[i+n[1]-2]-h[i]\n if q==-1 or q>a:\n q=a\nprint(q)', 'n=input().split()\nn=[int(i) for i in n]\nh=[0]*n[0]\nfor i in range(n[0]):\n #h.append(int(input()))\n h[i]=int(input())\nh.sort()\n\nq=-1\nfor i in range(len(h)):\n a=h[i+n[1]-1]-h[i]\n if q==-1 or q>a:\n q=a\n if q==0:\n break\nprint(q)', 'n=input().split()\nn=[int(i) for i in n]\nh=[0]*n[0]\nfor i in range(n[0]):\n h[i]=int(input())\nh.sort()\nprint(h)\nq=-1\nfor i in range(0,len(h)-n[1]+1):\n a=h[i+n[1]-1]-h[i]\n print(i+n[1]-1,i)\n if q==-1 or q>a:\n q=a\nprint(q)', 'n=input().split()\nn=[int(i) for i in n]\nh=[0]*n[0]\nfor i in range(n[0]):\n h[i]=int(input())\nh.sort()\nq=-1\nfor i in range(0,len(h)-n[1]+1):\n a=h[i+n[1]-1]-h[i]\n if q==-1 or q>a:\n q=a\nprint(q)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s001532461', 's188606463', 's615741348', 's798677317', 's927306493', 's951277425', 's689638593'] | [7384.0, 7384.0, 2940.0, 7472.0, 7472.0, 10532.0, 7472.0] | [253.0, 245.0, 17.0, 246.0, 255.0, 378.0, 246.0] | [224, 231, 222, 203, 253, 237, 206] |
p03208 | u072606168 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k = map(int,input().split())\nh = [int(i) for i in input().split()]\nh.sort()\ng = []\nfor i in range(n-k+1):\n g.append(h[i:i+k])\nprint(min(g))', 'n,k = map(int,input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\nh.sort()\ng = []\nfor i in range(n-k+1):\n g.append(h[i:i+k])\nprint(min(g))', "n,k = map(int,input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\nh.sort()\ng = float('inf')\nfor i in range(n-k+1):\n g = min(g, h[i] - h[i+k-1])\nprint(g)", 'NK = [int(i) for i in input().split()]\nN,K = NK[0],NK[1]\nh = []\nh1 = []\nfor i in range(N):\n h.append(int(input()))\nh.sort()\nfor i in range(N-1):\n h1.append(h[i+1]-h[i])\nhh,hhh = [],[]\nfor i in range(N-K):\n hh.append([0]*i+h1+[0]*(K-2-i))\nfor i in range(N-K+1):\n h2 = 0\n for j in range(K-1):\n h2 = h2 + hh[j][i+K-2]\n hhh.append(h2)\nprint(min(hhh))\n ', "n,k = map(int,input().split())\nh = []\nfor i in range(n):\n h.append(int(input()))\nh.sort()\ng = float('inf')\nfor i in range(n-k+1):\n g = min(g, h[i+k-1] - h[i])\nprint(g)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s127159944', 's725740358', 's767953758', 's967800877', 's301988565'] | [10288.0, 891216.0, 7384.0, 1377796.0, 7384.0] | [54.0, 2158.0, 256.0, 2186.0, 255.0] | [142, 155, 169, 380, 169] |
p03208 | u076512055 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['def ans(n,x):\n if n == 1:\n if x == 1:\n return 0\n elif x == 2:\n return 1\n elif x == 3:\n return 2\n else:\n return 3\n else:\n if x == 1:\n return 0\n if 2 <= x <= 2**(n+1) -2:\n return ans(n-1,x-1)\n if x == 2**(n+1) -1:\n return 2**n - 1 + 1\n if 2**(n+1) <= x <= 2**(n+2) -4:\n return 2**n - 1 + 1 + ans(n-1,x-2**(n+1)+1)\n else:\n return 2 * (2**n - 1) + 1\n \nN, X = map(int,input().split())\n\nprint(ans(N,X))', 'N, K = map(int, input().split())\nh = [0]*N\n\nfor n in range(N):\n h[n] = int(input())\n \nh.sort()\n\ntree = h[:K]\nheight = []\nheight.append(tree[-1]-tree[0])\n\nfor n in range(K,N):\n tree.pop(0)\n tree.append(h[n])\n height.append(tree[-1]-tree[0]) \n\nprint(min(height))'] | ['Runtime Error', 'Accepted'] | ['s607552126', 's920357916'] | [4008.0, 11172.0] | [395.0, 970.0] | [571, 276] |
p03208 | u087917227 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k = map(int,input().split())\nhn = [int(input()) for i in range(n)]\n\n\nhn.sort()\n\nprint(hn)\n\nprint(min(hn[i+k-1] - hn[i] for i in range(i-k+1)))', 'n,k = map(int,input().split())\nhn = [int(input()) for i in range(n)]\n\nhn.sort()\n\nprint(min(hn[i+k-1] - hn[i] for i in range(i-k+1)))', 'n,k = map(int,input().split())\nhn = [int(input()) for i in range(n)]\n\nhn.sort()\n\nprint(min(hn[i+k-1] - hn[i] for i in range(n-k+1)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s633692085', 's697331139', 's583854287'] | [10624.0, 7384.0, 7484.0] | [219.0, 209.0, 222.0] | [242, 132, 132] |
p03208 | u090406054 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n, k=map(int,input().split())\na=[input() for i in range(n)]\na.sort()\nb=[]\nfor p in range(n-k):\n c=a[p+k]-a[p]\n b.append(c)\n \nprint(min(b))\n ', 'n, k=map(int,input().split())\na=[int(input()) for i in range(n)]\na.sort()\nb=[]\nfor p in range(n-k+1):\n c=a[p+k-1]-a[p]\n b.append(c)\n \nprint(min(b))\n \n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s424028745', 's790718991'] | [16500.0, 17036.0] | [156.0, 186.0] | [144, 157] |
p03208 | u094565093 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N,K=map(int,input().split())\nh=[int(input()) for i in range(N)]\nh.sort()\nmindif=h[K-1]-h[0]\nfor i in range(N-K):\n tmp=h[i:i+K-1]\n dif=tmp[-1]-tmp[0]\n if mindif>dif:\n mindif=dif\nprint(mindif)\n', 'N,K=map(int,input().split())\nh=[int(input()) for i in range(N)]\nh.sort()\nmindif=h[K-1]-h[0]\nfor i in range(N-K+1):\n dif=h[i+K-1]-h[i]\n if mindif>dif:\n mindif=dif\nprint(mindif)'] | ['Wrong Answer', 'Accepted'] | ['s135926632', 's904321831'] | [8396.0, 7384.0] | [2104.0, 229.0] | [207, 188] |
p03208 | u098982053 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['N,K = map(int,input().split(" "))\nH = sorted([int(input()) for _ in range(N)])\nMin = 10**10\nprint(H)\nfor i in range(K-1,len(H))[::-1]:\n Abs = H[i]-H[i-(K-1)]\n if Abs<Min:\n Min = Abs\nprint(Min)', 'N,K = map(int,input().split(" "))\nH = sorted([int(input()) for _ in range(N)])\nMin = 10**10\nfor i in range(K-1,len(H))[::-1]:\n Abs = H[i]-H[i-(K-1)]\n if Abs<Min:\n Min = Abs\nprint(Min)'] | ['Wrong Answer', 'Accepted'] | ['s659920964', 's337143646'] | [11272.0, 8280.0] | [243.0, 237.0] | [205, 196] |
p03208 | u101574948 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['n,k=map(int,input().split())\nh=sorted([int(input()) for _ in range(n)])\ngap=[h[i]-h[i-1] for i in range(1,n)]\ntmp=0\nlst=[gap[0]]\nfor i in range(1,len(gap)):\n lst.append(gap[i]+lst[i-1])\nprint(gap,lst)\nans=[lst[k-2]]\nfor i in range(k,n):\n ans.append(lst[i-1]-lst[i-k])\nprint(ans)\nprint(min(ans))', 'n,k=map(int,input().split())\nh=sorted([int(input()) for _ in range(n)])\ngap=[h[i]-h[i-1] for i in range(1,n)]\ntmp=0\nlst=[gap[0]]\nfor i in range(1,len(gap)):\n lst.append(gap[i]+lst[i-1])\n#print(gap,lst)\nans=[lst[k-2]]\nfor i in range(k,n):\n ans.append(lst[i-1]-lst[i-k])\n#print(ans)\nprint(min(ans))'] | ['Wrong Answer', 'Accepted'] | ['s963343368', 's029661026'] | [23272.0, 19644.0] | [301.0, 271.0] | [300, 302] |
p03208 | u102242691 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['import sys\nsys.setrecursionlimit(1000000000)\nINF=10**9\nn,a,b,c=map(int,input().split())\nl=[int(input()) for i in range(n)]\ndef dfs(i,x,y,z):\n if i==n:\n if min(x,y,z)>0:\n return abs(x-a)+abs(y-b)+abs(z-c)-30\n else:\n return INF\n ans=dfs(i+1,x,y,z)\n ant=dfs(i+1,x+l[i],y,z)+10\n anu=dfs(i+1,x,y+l[i],z)+10\n anv=dfs(i+1,x,y,z+l[i])+10\n return min(ans,ant,anu,anv)\nprint(dfs(0,0,0,0))\n', '\nn,k = map(int,input().split())\nh = [int(input()) for _ in range(n)]\nh.sort()\n\nt = []\n\nfor i in range(n-k+1):\n t.append(h[i+k-1]-h[i])\nprint(min(t))\n'] | ['Runtime Error', 'Accepted'] | ['s356709962', 's723369986'] | [3064.0, 11288.0] | [18.0, 233.0] | [433, 152] |
p03208 | u102367647 | 2,000 | 1,048,576 | In some other world, today is Christmas Eve. There are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \leq i \leq N) is h_i meters. He decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible. More specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}? | ['\n\nfrom sys import stdin\n\ninput = stdin.readline\n\nN, K = list(map(int, input().split()))\n\nh = [int(input()) for _ in range(N)]\nh.sort()\n\nhdiff = [None]*(N-K+1)\n\nfor i in range(N-K+1):\n hdiff[i] = h[i+K-1] - h[i]\n\nprint(h)\nprint(hdiff)\nprint(min(hdiff))\n', '\n\nfrom sys import stdin\n\ninput = stdin.readline\n\nN, K = list(map(int, input().split()))\n\nh = [int(input()) for _ in range(N)]\nh.sort()\n\nhdiff = [None]*(N-K+1)\n\nfor i in range(N-K+1):\n hdiff[i] = h[i+K-1] - h[i]\n\nprint(min(hdiff))\n'] | ['Wrong Answer', 'Accepted'] | ['s439716070', 's237699565'] | [14804.0, 11036.0] | [139.0, 124.0] | [279, 257] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.