일기 대신 코드 슬쩍

# 13305번 주유소 n = int(input()) distance = list(map(int,input().split())) price = list(map(int,input().split())) distance.insert(-1,0) m = min(price[:-2]) cost,oil = 0,0 for i in range(n): if price[i] == m: for j in range(i,n): cost += distance[j]*price[i] oil += distance[j] break else: if oil == 0: oil += distance[i] cost += distance[i]*price[i] oil -= distance[i] print(cost) Uploaded by Notion2T..

# 잃어버린 괄호 sik = input().split('-') k = 0 plst = [] for i in sik: plst = map(int,i.split('+')) k += sum(plst) k = -k k += 2*int(sum(map(int,sik[0].split('+')))) print(k) Uploaded by Notion2Tistory v1.1.0

#백준 1931번 회의실 배정 n = int(input()) time = [] for i in range(n): start,end = map(int,input().split()) time.append([start, end]) count = 0 time.sort(key=lambda x: (x[0],x[1])) now = time[0] for i in range(1,len(time)): if now[1] = time[i][1]: now = time[i] count += 1 print(count)반례 좀 찾아줘요,, 계속 틀림#백준 1931번 회의실 배정 n = int(input()) time = [] for i in range(n): start,end = map(int,input().split()) time..

# 백준 11399번 ATM n = int(input()) jul = list(map(int,input().split())) jul.sort() waiting = 0 for i in range(len(jul)): waiting += jul[i] * (len(jul)-i) print(waiting)저번에 풀었을 때에 비해 아주 조금..!! 나아졌다N = int(input()) time = [] sum = 0 time = list(map(int, input().split())) time = sorted(time) for i in range(len(time)): sum += time[i] * N N -= 1 print(sum)저번 풀이 Uploaded by Notion2Tistory v1.1.0

#백준 11047번 동전 0 (그리디사용 X) n,k = map(int, input().split()) a = [] for _ in range(n): a.append(int(input())) a.reverse() won, i,count = 0,0,0 while True: if won k: won -= a[i] count -= 1 i += 1 else: break print(count)그리디는 개뿔.. 당연히 시간초과#백준 11047번 동전 0 n,k = map(int, input().split()) a = [] for _ in range(n): a.append(int(input())) a.reverse() count = 0 for i ..

#백준 11047번 동전 0 (그리디사용 X) n,k = map(int, input().split()) a = [] for _ in range(n): a.append(int(input())) a.reverse() won, i,count = 0,0,0 while True: if won k: won -= a[i] count -= 1 i += 1 else: break print(count)그리디는 개뿔.. 당연히 시간초과#백준 11047번 동전 0 n,k = map(int, input().split()) a = [] for _ in range(n): a.append(int(input())) a.reverse() count = 0 for i ..

# 백준 2193번 이친수 n = int(input()) d = [[0 for j in range(2)] for i in range(91)] d[1] = [0,1] d[2] = [1,0] for i in range(3,n+1): d[i][0] = d[i-1][0] + d[i-1][1] d[i][1] = d[i-1][0] print(d[n][0]+d[n][1]) Uploaded by Notion2Tistory v1.1.0

# 백준 10815번 숫자 카드 N = int(input()) Nlist = list(map(int, input().split())) M = int(input()) Mlist = list(map(int, input().split())) Nlist.sort() def binary(array, target, start, end): while start target: end = mid - 1 else: start = mid + 1 return None for i in Mlist: result = binary(Nlist, i, 0, N-1) if result != None: print('1',end = ' ') else: print('0',end = ' ') Uploaded by Notion2Tistory v1..