[APS] Cake Shop

// 2021 prv kolokvium - termin 1

import java.util.NoSuchElementException;
import java.util.Scanner;

class Cake{
    private String ime;
    private int cena;

    public Cake(String ime, int cena) {
        this.ime = ime;
        this.cena = cena;
    }

    public String getIme() {
        return ime;
    }

    public int getCena() {
        return cena;
    }

    @Override
    public String toString() {
        return String.valueOf(ime);
    }
}
public class CakeShop
{
    public static void removeCakes(SLL<Cake> cakes){
    SLLNode<Cake> temp= cakes.getFirst();
    double prosecna_cena, suma=0;
    int broj_torti= cakes.length();
    while(temp!=null){
        suma+= temp.element.getCena();
        temp=temp.succ;
    }
    prosecna_cena= suma/(double)broj_torti;
    //System.out.println(prosecna_cena);
    temp=cakes.getFirst();
    while(temp!=null){
        if(temp.element.getCena()>prosecna_cena){
            cakes.delete(temp);
        }
        temp=temp.succ;
    }
    }

    public static void main(String[] args)
    {
        Scanner input= new Scanner(System.in);
        int n= Integer.parseInt(input.nextLine());
        SLL<Cake> cakes= new SLL<Cake>();
        for(int i=0;i<n;i++){
            String[] info_torta= input.nextLine().split("\\s+");;
            cakes.insertLast(new Cake(info_torta[0],Integer.parseInt(info_torta[1])));
        }
        removeCakes(cakes);
        System.out.println(cakes.toString());
    }
}



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() {
        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();
        if (first != null) {
            SLLNode<E> tmp = first;
            ret += tmp;
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret += " " + tmp;
            }
        } else
            ret = "Prazna lista!!!";
        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;
            }
            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;
    }
}

//TestCase1
//6
//Jagoda 500
//Cresha 800
//Meshana 300
//ChokoladoKaramela 5500
//Vanilla 4000
//Vishna 7500

//Jagoda Cresha Meshana

//TestCase2
//5
//Urma 900
//Tiramisu 1605
//Sacher 777
//Snickers 1234
//Avocado 768

//Urma Sacher Avocado