class Solution {
public int minDays(int[] bloomDay, int m, int k) {
int nums=m*k;
if(bloomDay.length<nums)return -1;
int low=1,high=Arrays.stream(bloomDay).max().getAsInt();
while(low<high){
int mid=(low+high)/2;
int count= check(bloomDay,mid,m,k);
if(count<m)low=mid+1;
else high=mid;
}
return low;
}
public int check(int[] bloomDay,int mid,int m,int k){
int slow=-1,count=0;
int i=0;
while(i<bloomDay.length){
if(bloomDay[i]<=mid){
if(i-slow==k){
count++;
slow=i;
}
i++;
}
else{
while(i<bloomDay.length&&bloomDay[i]>mid)
i++;
slow=i-1;
}
}
return count;
}
}