Додавање елементи под просек

import java.util.Scanner;

public class ProsecenZbir {
    public static float zbir(DLL<Integer> list){
        DLLNode<Integer> tmp=list.getFirst();
        float sum=0;

        while (tmp!=null){
            sum+=tmp.element;
            tmp=tmp.succ;
        }
        return sum/list.length();
    }

    public static void result(DLL<Integer> list1, DLL<Integer> list2){
        DLL<Integer> rezultanta=new DLL<>();
        DLLNode<Integer> tmp1=list1.getFirst();
        DLLNode<Integer> tmp2=list2.getLast();

        float prosek1=zbir(list1);
        float prosek2=zbir(list2);

        int sum1=0;
        int sum2=0;

        while (true) {
            sum1 += tmp1.element;
            if (sum1 < prosek1+prosek2) {
                rezultanta.insertLast(tmp1.element);
                tmp1 = tmp1.succ;
            } else {
                    break;
            }
        }

        while (true){
            sum2+=tmp2.element;
            if (sum2 < prosek2+prosek1) {
                rezultanta.insertLast(tmp2.element);
                tmp2 = tmp2.pred;
            } else {
                   break;
            }
        }
        System.out.println(rezultanta);
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);

        int n1=in.nextInt();
        DLL<Integer> list1=new DLL<>();
        for(int i=0;i<n1;i++){
            list1.insertLast(in.nextInt());
        }

        int n2=in.nextInt();
        DLL<Integer> list2=new DLL<>();
        for(int i=0;i<n2;i++){
            list2.insertLast(in.nextInt());
        }
        result(list1,list2);
    }
}