Resenie

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class DLL<E> {
    private DLLNode<E> first, last;

    public DLL() {
        // Construct an empty SLL
        this.first = null;
        this.last = null;
    }

    public void deleteList() {
        first = null;
        last = null;
    }

    public int length() {
        int ret;
        if (first != null) {
            DLLNode<E> tmp = first;
            ret = 1;
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret++;
            }
            return ret;
        } else
            return 0;

    }

    public DLLNode<E> find(E o) {
        if (first != null) {
            DLLNode<E> tmp = first;
            while (tmp.element != o && tmp.succ != null)
                tmp = tmp.succ;
            if (tmp.element == o) {
                return tmp;
            } else {
                System.out.println("Elementot ne postoi vo listata");
            }
        } else {
            System.out.println("Listata e prazna");
        }
        return first;
    }

    public void insertFirst(E o) {
        DLLNode<E> ins = new DLLNode<E>(o, null, first);
        if (first == null)
            last = ins;
        else
            first.pred = ins;
        first = ins;
    }

    public void insertLast(E o) {
        if (first == null)
            insertFirst(o);
        else {
            DLLNode<E> ins = new DLLNode<E>(o, last, null);
            last.succ = ins;
            last = ins;
        }
    }

    public void insertAfter(E o, DLLNode<E> after) {
        if(after==last){
            insertLast(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, after, after.succ);
        after.succ.pred = ins;
        after.succ = ins;
    }

    public void insertBefore(E o, DLLNode<E> before) {
        if(before == first){
            insertFirst(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, before.pred, before);
        before.pred.succ = ins;
        before.pred = ins;
    }

    public E deleteFirst() {
        if (first != null) {
            DLLNode<E> tmp = first;
            first = first.succ;
            if (first != null) first.pred = null;
            if (first == null)
                last = null;
            return tmp.element;
        } else
            return null;
    }

    public E deleteLast() {
        if (first != null) {
            if (first.succ == null)
                return deleteFirst();
            else {
                DLLNode<E> tmp = last;
                last = last.pred;
                last.succ = null;
                return tmp.element;
            }
        }
        // else throw Exception
        return null;
    }

    public E delete(DLLNode<E> node) {
        if(node==first){
            deleteFirst();
            return node.element;
        }
        if(node==last){
            deleteLast();
            return node.element;
        }
        node.pred.succ = node.succ;
        node.succ.pred = node.pred;
        return node.element;

    }

    @Override
    public String toString() {
        String ret = new String();
        if (first != null) {
            DLLNode<E> tmp = first;
            ret += tmp + "<->";
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

    public String toStringR() {
        String ret = new String();
        if (last != null) {
            DLLNode<E> tmp = last;
            ret += tmp + "<->";
            while (tmp.pred != null) {
                tmp = tmp.pred;
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

    public DLLNode<E> getFirst() {
        return first;
    }

    public DLLNode<E> getLast() {

        return last;
    }

    public void izvadiDupliIPrebroj(){

    }
}
 class DLLNode<E> {
     protected E element;
     protected DLLNode<E> pred, succ;

     public DLLNode(E elem, DLLNode<E> pred, DLLNode<E> succ) {
         this.element = elem;
         this.pred = pred;
         this.succ = succ;
     }

     @Override
     public String toString() {
         return element.toString();
     }
 }

class Racer{
    String name;
    int fuel;

    public Racer(String name, int fuel) {
        this.name = name;
        this.fuel = fuel;
    }

    @Override
    public String toString() {
        return String.format("%s(%d) ", name, fuel);
    }

    public void setFuel(int fuel) {
        this.fuel = fuel;
    }
}
/*
5
Hamilton 2
Vettel 3
Raikkonen 4
Verstappen 3
Leclerc 5
5
Leclerc 3
Verstappen 5
Raikkonen 4
Vettel 3
Hamilton 2
 */



public class ClassRace {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(reader.readLine());
        DLL<Racer> list = new DLL<>();
        for (int i = 0; i < N; i++) {
            String[] pomNiza = reader.readLine().split(" ");
            list.insertLast(new Racer(pomNiza[0], Integer.parseInt(pomNiza[1])));
        }
        printRace(list);
       int M = Integer.parseInt(reader.readLine());

        for(int i=0;i<M;i++){
            String[] pomNiza = reader.readLine().split(" ");
            Racer racer = new Racer(pomNiza[0], Integer.parseInt(pomNiza[1]));
            list = updateRace(list, racer);
            printRace(list);
        }

    }

    private static DLL<Racer> updateRace(DLL<Racer> list, Racer racer) {
        DLLNode<Racer> tmp = list.getFirst();

        while(tmp!=null) {

            if(tmp.element.name.equals(racer.name)){
                if(tmp.element.fuel >= racer.fuel){
                   tmp.element.setFuel(tmp.element.fuel-racer.fuel);
                 //tuka treba da se pomestuvaat vozacite drugoto se e okej najverojatno
                 //  DLLNode<Racer> tmpInside = tmp.succ;
                     DLLNode<Racer> tmpInside = tmp;//napravi kopija na vozacot  kade sto e i
                                                 // odi za tolku mesta napred kolku sto potrosil fuel
                    for(int i=0;i<racer.fuel;i++) {
                        if(tmpInside==null) break;// tmpInside moze da dojde do null pred for da zavrsi so vrtenje
                        tmpInside=tmpInside.pred;
                    }
                    // postojat 2 uslovi, tmpInside da stigne do vozacot pred koj sto finalno treba da e
                    // ili da fuelot e pogolem od brojot na vozaci pred nego vo toj slucaj tmpInside ke reachne null
                    // dokolku tmpInside stigne null znaci treba da e posleden t.e prv vo trkata
                    if(tmpInside==null) {
                        list.insertFirst(tmp.element);// treba da e last ali deka ja printas obranto ide first vo slucajov
                        list.delete(tmp);
                        return list;
                    }else {
                        //dokolku ne stigne null znaci prestignal 2,3 itn
                        //i treba da se vnese pred toj kade sto stignal for-to
                        list.insertBefore(tmp.element, tmpInside);
                        list.delete(tmp);
                        return list;
                    }

                }
                else {
                    list.delete(tmp);
                }

            }

           tmp=tmp.succ;
        }
        return list;
    }

    private static void printRace(DLL<Racer> list){
        DLLNode<Racer> tmp = list.getLast();

        while(tmp!=null){
            if(tmp.pred==null){
                System.out.println(tmp.element.toString());
            }
            else{
                System.out.print(tmp.element.toString() + "->" + " ");
            }
            tmp = tmp.pred;
        }
    }

}