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.Return 1 if any such integer p is present else, return -1.

public class Solution {
public int solve(int[] A) {
Arrays.sort(A);
int [] newarr = new int [A.length];
for (int i = A.length -1 ; i >=0 ; i--){
newarr[A.length-1-i]=A[i];
}
for (int i = 0 ; i < A.length ; i++){
if (newarr[i]==i){
return 1;
}
}
return -1;
}
}