F1 Trka

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.NoSuchElementException;

class SLLNode<E> {
    protected E element;
    protected SLLNode<E> succ;

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

    @Override
    public String toString() {
        return element.toString();
    }
}
class SLL<E> {
    private SLLNode<E> first;

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

    public void deleteList() {
        first = null;
    }

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

    }

    @Override
    public String toString() {
        String ret = new String();
        SLLNode<E> dvizi = first;
        while(dvizi.succ!=null)
        {
            ret = ret + dvizi.element + " -> ";
            dvizi = dvizi.succ;
        }
        ret = ret + dvizi.element;
        return ret;
    }

    public void insertFirst(E o) {
        SLLNode<E> ins = new SLLNode<E>(o, first);
        first = ins;
    }

    public void insertAfter(E o, SLLNode<E> node) {
        if (node != null) {
            SLLNode<E> ins = new SLLNode<E>(o, node.succ);
            node.succ = ins;
        } else {
            System.out.println("Dadenot jazol e null");
        }
    }

    public void insertBefore(E o, SLLNode<E> before) {

        if (first != null) {
            SLLNode<E> tmp = first;
            if(first==before){
                this.insertFirst(o);
                return;
            }
//ako first!=before
            while (tmp.succ != before)
                tmp = tmp.succ;
            if (tmp.succ == before) {
                SLLNode<E> ins = new SLLNode<E>(o, before);
                tmp.succ = ins;
            } else {
                System.out.println("Elementot ne postoi vo listata");
            }
        } else {
            System.out.println("Listata e prazna");
        }
    }

    public void insertLast(E o) {
        if (first != null) {
            SLLNode<E> tmp = first;
            while (tmp.succ != null)
                tmp = tmp.succ;
            SLLNode<E> ins = new SLLNode<E>(o, null);
            tmp.succ = ins;
        } else {
            insertFirst(o);
        }
    }

    public E deleteFirst() {
        if (first != null) {
            SLLNode<E> tmp = first;
            first = first.succ;
            return tmp.element;
        } else {
            System.out.println("Listata e prazna");
            return null;
        }
    }

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

    }

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

    public SLLNode<E> find(E o) {
        if (first != null) {
            SLLNode<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 Iterator<E> iterator () {
        // Return an iterator that visits all elements of this list, in left-to-right order.
        return new LRIterator<E>();
    }

// //////////Inner class ////////////

    private class LRIterator<E> implements Iterator<E> {

        private SLLNode<E> place, curr;

        private LRIterator() {
            place = (SLLNode<E>) first;
            curr = null;
        }

        public boolean hasNext() {
            return (place != null);
        }

        public E next() {
            if (place == null)
                throw new NoSuchElementException();
            E nextElem = place.element;
            curr = place;
            place = place.succ;
            return nextElem;
        }

        public void remove() {
//Not implemented
        }
    }

    public void mirror(){
        if (first != null) {
//m=nextsucc, p=tmp,q=next
            SLLNode<E> tmp = first;
            SLLNode<E> newsucc = null;
            SLLNode<E> next;

            while(tmp != null){
                next = tmp.succ;
                tmp.succ = newsucc;
                newsucc = tmp;
                tmp = next;
            }
            first = newsucc;
        }

    }

    public void merge (SLL<E> in){
        if (first != null) {
            SLLNode<E> tmp = first;
            while(tmp.succ != null)
                tmp = tmp.succ;
            tmp.succ = in.getFirst();
        }
        else{
            first = in.getFirst();
        }
    }
}

class F1Racer
{
    String ime;
    int gorivo;

    public F1Racer(){}

    public F1Racer(String ime , int gorivo)
    {
        this.ime=ime;
        this.gorivo=gorivo;
    }
    public String toString()
    {
        return ime+"("+gorivo+")";
    }
}

public class F1Race {
    private static boolean promeniLista(SLL<F1Racer>trka , String imeNaVozac , int gorivo)
    {
        boolean daliPecati=false;
        SLLNode<F1Racer> dvizi=trka.getFirst();
        while (dvizi!=null)
        {
            if(dvizi.element.gorivo<gorivo)
            {
                trka.delete(dvizi);
                dvizi=null;
                daliPecati=true;
                break;
            }
            else
            {
                int brojac=gorivo;
                SLLNode<F1Racer> pom=dvizi;
                if(pom.succ==null)
                {
                    break;
                }
                while (pom.succ!=null && brojac!=0)
                {
                    pom=pom.succ;
                    brojac--;
                }
                trka.insertAfter(new F1Racer(dvizi.element.ime , dvizi.element.gorivo-gorivo),pom);
                trka.delete(dvizi);
                dvizi=null;
                daliPecati=true;
                break;
            }
        }
        dvizi=dvizi.succ;
        return daliPecati;
    }
    public static void main(String[] args) throws IOException {
        SLL<F1Racer> trka=new SLL<>();
        BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));

        int n=Integer.parseInt(bf.readLine());
        for(int i=0;i<n;i++)
        {
            String line= bf.readLine();
            String[]parts=line.split("");
            trka.insertLast(new F1Racer(parts[0], Integer.parseInt(parts[1])));
        }
        int m=Integer.parseInt(bf.readLine());
        for(int i=0;i<m;i++)
        {
            String line=bf.readLine();
            String[]parts=line.split("");
            String imeNaVozac=parts[0];
            int gorivo=Integer.parseInt(parts[1]);

            boolean daliPecati=promeniLista(trka,imeNaVozac,gorivo);
            if(daliPecati)
                System.out.println(trka);
        }
    }
}