题解 | #输出单向链表中倒数第k个结点#

class ListNode(object):
    def __init__(self, item):
        self.item = item
        self.next = None


while True:
    try:
        n = int(input())
        L = input().split()[::-1]
        k = int(input())
        head = ListNode(L.pop())
        cur = head
        for _ in range(1, n):
            cur.next = ListNode(L.pop())
            cur = cur.next
        cur = head
        len = 1
        while cur.next is not None:
            cur = cur.next
            len += 1
        cur = head
        for _ in range(len - k):
            cur = cur.next
        print(cur.item)
    except:
        break