Problem:


Score : 200 points

Problem Statement

Niwango created a playlist of N songs.
The title and the duration of the i-th song are s_i and t_i seconds, respectively.
It is guaranteed that s_1,\ldots,s_N are all distinct.

Niwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)
However, he fell asleep during his work, and he woke up after all the songs were played.
According to his record, it turned out that he fell asleep at the very end of the song titled X.

Find the duration of time when some song was played while Niwango was asleep.

Constraints

1 \leq N \leq 50

s_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.

s_1,\ldots,s_N are distinct.

There exists an integer i such that s_i = X.

1 \leq t_i \leq 1000

t_i is an integer.

Input

Input is given from Standard Input in the following format:

N
s_1 t_1
\vdots
s_{N} t_N
X

Output

Print the answer.

Sample Input 1

3
dwango 2
sixth 5
prelims 25
dwango

Sample Output 1

30

While Niwango was asleep, two songs were played: sixth and prelims.

The answer is the total duration of these songs, 30.

Sample Input 2

1
abcde 1000
abcde

Sample Output 2

0

No songs were played while Niwango was asleep.

In such a case, the total duration of songs is 0.

Sample Input 3

15
ypnxn 279
kgjgwx 464
qquhuwq 327
rxing 549
pmuduhznoaqu 832
dagktgdarveusju 595
wunfagppcoi 200
dhavrncwfw 720
jpcmigg 658
wrczqxycivdqn 639
mcmkkbnjfeod 992
htqvkgkbhtytsz 130
twflegsjz 467
dswxxrxuzzfhkp 989
szfwtzfpnscgue 958
pmuduhznoaqu

Sample Output 3

6348



Sample input:
3
dwango 2
sixth 5
prelims 25
dwango


Sample output:
30

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N = r_int()
    ST = [R_str() for _ in range(N)]
    X = r()
    ans = 0
    flag= False
    for s,t in ST:
        if flag:
            ans += int(t)
        if s == X:
            flag = True
    print(ans)

    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
s = []
t = []
for _ in range(n):
    si, ti = input().split()
    ti = int(ti)
    s.append(si)
    t.append(ti)
x = input()
ans = sum(t)
for i in range(n):
    ans -= t[i]
    if s[i] == x:
        break
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
s_t = []
for i in range(N):
    s, t = input().split()
    s_t.append((s, int(t)))
X = input()

flag = False
ans = 0
for s, t in s_t:
    if flag:
        flag = True
        ans += t
    if s == X:
        flag = True

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
name = []
time = []
for _ in range(n):
    s, t = input().split()
    t = int(t)
    name.append(s)
    time.append(t)
x = input()
total = 0
ind = name.index(x)
for index, t in enumerate(time):
    if index <= ind:
        continue
    total += t
print(total)

Submission status: Accepted

Solution code:
n = int(input())
st = [list(input().split()) for _ in range(n)]
x = input()

sums = 0
for s, t in st:
  t = int(t)
  sums += t

ans = 0
for s, t in st:
  t = int(t)
  ans += t
  if s == x:
    break

print(sums - ans)

Submission status: Accepted

Solution code:
N = int(input())
s = ['' for i in range(N)]
t = [0 for i in range(N)]

for i in range(N):
    ss, tt = input().split()
    s[i] = ss
    t[i] = int(tt)
X = input()
flag = False
ans = 0
for i in range(N):
    if flag:
        ans += t[i]
    else:
        if X == s[i]:
            flag = True
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

lis_A = []
lis_B = []

for i in range(N):
    a,b = map(str,input().split())
    lis_A.append(a)
    lis_B.append(int(b))
temp = input()
Sum = sum(lis_B)
ans = Sum - sum(lis_B[:lis_A.index(temp)+1])
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
stList = [input().split() for i in range(N)]
X = input()

countFlg = False
result = 0
for element in stList:
    if countFlg:
        result += int(element[1])

    if element[0] == X:
        countFlg = True

print(result)

Submission status: Accepted

Solution code:
input = raw_input

n = int(input())

d = {}
times = []
for i in range(n):
    name, time = input().split(" ")
    d[name] = i
    time = int(time)
    times.append(time)

name = input()
i = d[name]
start_i = i+1
if start_i == n:
    print(0)
else:
    out = sum(times[start_i:])
    print(out)

Submission status: Accepted

Solution code:
N=int(input())
S=[]
T=[]
a=0
for i in range(N):
  s,t=map(str,input().split())
  S.append(s)
  T.append(int(t))
X=input()

a=S.index(X)
print(sum(T[(a+1):N]))

Submission status: Accepted

Solution code:
n = int(input())
songs=[input().split(" ") for i in range(n)]
sleep = input()

flag = False
res = 0

for song in songs:
  if flag == True:
    res += int(song[1])
  
  if song[0] == sleep:
    flag = True
  

print(res)

Submission status: Accepted

Solution code:
from itertools import accumulate
N = int(input())
s =[]
t =[]
for i in range(N):
    s1, t1 = map(str,input().split())
    s.append(s1)
    t.append(int(t1))
X = input()

T = list(accumulate(t[::-1]))[::-1] + [0]

print(T[s.index(X) + 1])

Submission status: Accepted

Solution code:
N=int(input())
S,T=[],[]
for n in range(N):
    s,t=input().split()
    S.append(s)
    T.append(int(t))
X=input()
T_sum=sum(T)
now_sum=0
for n in range(N):
    now_sum+=T[n]
    if X==S[n]:
        print(T_sum-now_sum)
        break

Submission status: Accepted

Solution code:
N = int(input())
S = []
T = []
for i in range(N):
    s,t =  input().split()
    t = int(t)
    S.append(s)
    T.append(t)
# N,M = map(int, input().split())
# A = list(map(int, input().split()))

X = input()

ans = 0
for i in range(N):
    if S[i] == X:
        ans = i+1
print(sum(T[ans:]))

Submission status: Accepted

Solution code:
n=int(input())
s=list(input().split() for i in range(n))
x=input()
count=0
flag=False
for i in range(n):
    if s[i][0]==x:
        flag=True
        continue
    if flag:
        count+=int(s[i][1])

print(count)

Submission status: Accepted

Solution code:
n = int(input())
music = []
for i in range(n):
    s, t = input().split()
    t = int(t)
    music.append([s, t])
x = input()

ans = 0
time = False
for i in range(n):
    if time:
        ans += music[i][1]
    if music[i][0] == x:
        time = True

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
songs_list = []
time_list = []
for i in range(N):
  song, time = input().split()
  time = int(time)
  songs_list.append(song)
  time_list.append(time)
  
last_song = input()
for i in range(N):
  if last_song == songs_list[i]:
    num = i
    break
#print(songs_list[(num+1):])
print(sum(time_list[(num+1):]))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    S = []
    T = []
    for i in range(N):
        s, t = input().split()
        S.append(s.strip())
        T.append(int(t))
    x = input().strip()
    ans = sum(T)
    for i in range(N):
        ans -= T[i]
        if S[i] == x:
            break
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
bbn=1000000007
	
#+++++

		
def main():
	n = int(input())
	t=[]
	l=[]
	for i in range(n):
		b , c =  input().split()
		c=int(c)
		l.append(c)
		t.append(b)
	
	x = input()
	ii=t.index(x)
	
	ret=sum(l[ii+1:])
	
	print(ret)
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
n = int(input())
list = []
for i in range(n):
    s, t = input().split()
    list.append([s, int(t)])
x = input()

time = 0
is_sleep = False
for i in range(n):
    if is_sleep:
        time += list[i][1]
    if list[i][0] == x:
        is_sleep = True

print(time)

Submission status: Accepted

Solution code:
n = int(input())
#a_L = map(int,input().split())
aaa,t_L = [],[]
for i in range(n):
    s,t = map(str,input().split())
    aaa.append(s)
    t_L.append(int(t))
x = input()

i = aaa.index(x)
print(sum(t_L[i+1:]))

Submission status: Accepted

Solution code:
n = int(input())
st = [list(input().split()) for _ in range(n) ]
x = input()

# print(st)

j = 0
for i in range(n):
    k = st[i][0]
    if k==x:
        j = i
        break 

# print(j)

ans = 0
for i in range(j+1,n):
    ans += int(st[i][1])

print(ans)

Submission status: Accepted

Solution code:
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

n = int(readline())
S = []
T = []
for i in range(n):
    s, t = readline().decode('utf-8').split()
    t = int(t)
    S.append(s)
    T.append(t)
X = readline().decode('utf-8').split()[0]

idx = S.index(X)
res = sum(T[idx+1:])

print(res)

Submission status: Accepted

Solution code:
n = int(input())
s = []
t = []
for i in range(n):
    si,ti = map(str,input().split())
    s.append(si)
    t.append(int(ti))
x = input()

ans = 0
for i in range(s.index(x)+1,n):
    ans += t[i]

print(ans)

Submission status: Accepted

Solution code:
def A():
    N = int(input())
    index = {}
    durations = []
    for i in range(N):
        temp = input().split()
        index[temp[0]] = i
        durations.append(int(temp[1]))
    X = input()
    print(sum(durations[index[X]+1:]))

A()

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

N = int(input())
L = []
for i in range(N):
    L.append(list(map(str, input().split())))
S = input()

ans = 0
flag = False
for i in range(N):
    s,t = L[i]
    if flag:
        ans += int(t)
    if s == S:
        flag = True
print(ans)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    song_time = [None] * N
    song_name = [None] * N
    for i in range(N):
        tmp = input().split()
        song_name[i] = tmp[0]
        song_time[i] = int(tmp[1])
    X = input()

    ind = song_name.index(X)

    ret = 0
    for i in range(ind+1, N):
        ret += song_time[i]

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
A=[[0]*2 for i in range(n)]
for i in range(n):
  A[i][0],A[i][1]=input().split()
  A[i][1]=int(A[i][1])
x=input()
for i in range(n):
  if A[i][0]==x:
    break
ans=0
for j in range(i+1,n):
  ans=ans+A[j][1]
print(ans)

Submission status: Accepted

Solution code:
import numpy as np

def main():
    N = np.int64(input())
    sts = np.array([np.array([i for i in input().split(" ")]) for n in range(N)])
    X = input()
    musics = list(sts[:,0])
    times = sts[:,1].astype("int64")
    ind = musics.index(X)
    sleeptimes = times[ind+1:]
    #print(sleeptimes)
    ans = np.sum(sleeptimes)
    print(ans)
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

musics = [[] for i in range(N)]
for i in range(N):
    musics[i] = list(input().split())

X = input()

ans = 0
flg = False
for music in musics:
    if flg:
       ans += int(music[1])
    if music[0] == X:
        flg = True

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
L=[list(input().split()) for _ in range(n)]
x=input()
ans=0
flag=0
for l in L:
    if flag:
        ans += int(l[1])
    else:
        if l[0]==x:flag=1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
st = []
for i in range(n):
    st.append(list(input().split()))
x = input()

ans = 0
sleeped = False
for sti in st:
    if sleeped:
        ans += int(sti[1])
    if sti[0] == x:
        sleeped = True
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
st = [[i for i in input().split()] for j in range(n)]
x = input()

ans = 0

for i in reversed(range(n)):
    if st[i][0] == x:
        break
    ans += int(st[i][1])

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s_array = []
t_array = []
sum_time = 0
for i in range(n):
    s, t = input().split()
    t=int(t)
    s_array.append(s)
    t_array.append(t)
    sum_time += t
x = input()
for i in range(n):
    sum_time -= t_array[i]
    if s_array[i] == x:
        break
print(sum_time)

Submission status: Accepted

Solution code:
n=int(input())
s=[0]*n
t=[0]*n
for i in range(n):
    a,b=input().split()
    b=int(b)
    s[i]=a
    t[i]=b
x=input()
ans=sum(t)
for i in range(n):
    if s[i]==x:
        print(ans-t[i])
        exit()
    else:
        ans-=t[i]

Submission status: Accepted

Solution code:
n = int(input())
st = [input().split() for _ in range(n)]
x = input()

f = 0
ans = 0
for s, t in st:
    if f:
        ans += int(t)
    if s == x:
        f = 1

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

N = int(input())
s = []
for i in range(N):
    a = input().split()
    a[1] = int(a[1])
    s.append(a)
X = input()

flag = False
ans = 0
for i in range(N):
    if (flag):
        ans += s[i][1]
    if (s[i][0] == X):
        flag = True
print(ans)

Submission status: Accepted

Solution code:

def int2(x):
    try:
       return int(x)
    except:
        return x

N = int(input())
st = [list(map(int2,input().split())) for i in range(N)]
X = input()

ans = 0
flg = False
c = 0
for s,t in st:
    if s == X:
        flg = True
    if flg:
        if c ==0:
            c += 1
        else:
            ans += t
            c += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = [None]*n, [None]*n
for i in range(n):
    s[i], ti = input().split()
    t[i] = int(ti)
x = input()

print(sum(t[s.index(x)+1:]))

Submission status: Accepted

Solution code:
N = int(input())
S = []
T = []
from operator import itemgetter

for _ in range(N):
    s,t = input().split()
    S.append(s)
    T.append(int(t))

X = input()
def main():
    for i in range(N):
        if X == S[i]:
            print(sum(T[i + 1:]))
            return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    n = int(input())
    st = [input() for i in range(n)]
    x = input()
    isStart = False
    sum = 0
    for i in st:
        s, t = i.split()
        if s == x:
            isStart = True
            continue
        if isStart:
            sum += int(t)
    print(sum)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
s_t_list=[list(map(str,input().split())) for _ in range(n)]
x=input()

count = 0
ans = 0
for i in range(n):
    if count == 1:
         ans += int(s_t_list[i][1])
    if s_t_list[i][0] == x:
        count += 1
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
li=[input().split() for _ in range(n)]
m=input()

flg=False
result=0
for i in range(len(li)):
  if li[i][0]==m:
    flg=True
    continue
  if flg:
    result+=int(li[i][1])
print(result)

Submission status: Accepted

Solution code:
n = int(input())
total = 0
sleep = 0
awake_status = True
playlist = [ input().split() for i in range(n) ]
target = input()

for s, t in playlist:
    if awake_status == False:
        sleep += int(t)
    if s == target:
        awake_status = False
print(sleep)

Submission status: Accepted

Solution code:
n = int(input())
a = [list(map(str, input().split())) for _ in range(n)]
m = input()
for i in range(n):
    if a[i][0] == m:
        c = i
        break
d = 0
for i in range(i+1,n):
    d += int(a[i][1])
print(d)

Submission status: Accepted

Solution code:
from sys import stdin
import math

n = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip().split()) for _ in range(n)]
s = stdin.readline().rstrip()
time = 0
flag = 0
for i in li:
    if s == i[0]:
        flag = 1
        continue
    if flag == 1:
        time += int(i[1])

print(time)

Submission status: Accepted

Solution code:
n = int(input())
a = []
b = []
for i in range(n):
    s, t = map(str, input().split())
    a.append(s)
    b.append(int(t))

x = input()

p = a.index(x) + 1
le = 0
for j in range(p):
    le += b[j]

print(sum(b) - le)