Noble Integer

Problem Description

Given an integer array A, find if an integer p exists in the array such that the number of integers greater than p in the array equals p.

1 <= |A| <= 2*10^5
-108 <= A[i] <= 10^8

First and only argument is an integer array A.

Return 1 if any such integer p is present else, return -1.

Input 1:
A = [3, 2, 1, 3]

Input 2:
A = [1, 1, 3, 3]

Output 1:
1

Output 2:
-1

Explanation 1:
For integer 2, there are 2 greater elements in the array..

Explanation 2:
There exist no integer satisfying the required conditions.

Java

Python

JavaScript