Сортировка массивов int чисел

import java.util.Collections;
import java.util.Arrays;
import java.util.List;
public class HelloWorld{
     public static void main(String []args){
        List<Entity> entities = Arrays.asList(new Entity(3,5),new Entity(5,7),new Entity(3,1),new Entity(1,10));
        Collections.sort(entities);
        entities.forEach(System.out::println);
     }
}
class Entity implements Comparable<Entity> {
        private int weight;
        private int cost;
        public Entity(int weight, int cost) {
            this.weight = weight;
            this.cost = cost;
        }
        private double getMeasure(){
            return cost * 1.0 / weight;
        }
        @Override
        public int compareTo(Entity entity) {
            double thisMeasure = getMeasure();
            double thatMeasure = entity.getMeasure();
            if(thisMeasure < thatMeasure) return -1;
            return thisMeasure > thatMeasure ? 1 : 0;
        }
        @Override
        public String toString() {
        return "Entity{" +
                "weight=" + weight +
                ", cost=" + cost +
                ", difference=" + getMeasure() +
                '}';
    }
}

Можно сделать так:

List<Integer> sortedValues = Stream
            .generate(new Supplier<Map.Entry<Integer, Integer>>() {
                private int index = -1;
                @Override
                public Map.Entry<Integer, Integer> get() {
                    index++;
                    return new AbstractMap.SimpleEntry<>(values[index], weights[index]);
                }})
            .limit(values.length)
            .sorted(Map.Entry.comparingByValue())
            .map(Map.Entry::getKey)
            .collect(toList());