HELP NEEDED . THE PROBLEM STATEMENT WE NEED TO COUNT THE NO OF PAIRS OF A[i] , A[j] , where A[i] * A[j] > A[i] + A[j] . and i<j . The constraints are clearly mentioned that n can go upto 10^5 . So we cannot use brute force approach of nested loops of checking all pairs .
So . I DECIDED TO FIRST THE FREQUENCY OF ALL ELEMENTS . AND I STARTED TO ITERATE THE KEYSET .
FOR EACH ELEMENT IAM CHECKING THE POSSIBILTY THAT HOW MANY ELEMNTS IT CAN PAIR WITH .
IF THE ELEMENT IS GREATER THAN 1 . IT CAN BE PAIRED WITH ALL ELEMENTS TO ITS RIGHT.
AND ALSO IF THE ELEMENT IS GREATER THAN 2 . IF IT EXIST IN OCCURENCES OF MULTIPLS OF 2 . THEY CAN GENERATE (OCCURENCE/2) PAIRS .
THIS IS MY OBSERVATION . PLEASE ANYBODY HELP . WHAT IS WRONG IN MY LOGOC . AND HOW TO SOLVE THIS PROBLEM.
MY code is 
