Fastest way to check if two values times each other is greater then x in massive unsorted list | Java Community | Help. Code. Learn. | Page 1

So i have massive unsorted list of numbers and if two numbers times each other in the list is greater then x they should be removed and one point should be added but the problem is my current code is to slow.

My current method is to sorting the list in ascending order. Then in a for loop take the biggest value and multiply it with the smallest and if less then x, it remove the the smallest and redo the same until it match then it will remove both values and add a point. It does so until list has less then 2 numbers left

So does anyone have an faster method?

#Fastest way to check if two values times each other is greater then x in massive unsorted list