680
作者:
王政文
,
2021-06-22 20:39:23
,
所有人可见
,
阅读 383
#include<bits/stdc++.h>
using namespace std;
int n,m;
int L(100001);
bool check(long long mid){
long long cnt=0;
for(int i=1;i<=n;i++){
cnt=cnt+a[i]/k;
}
if(cnt>=m)return true;
else return false;
}
int main{
int maxL;
printf("%d%d",&n,&m);
for(int i;i<=n;i++){
scanf("%d",&L[i]);
maxL=(max,L[i]);
}
long long left=1,right=n+1;
while(left+1<right){
long long mid=(left+right)/2;
if(check(mid))left=mid;
else right=mid;
}
printf("%.2lf",left/100.0);
return 0;
}
📡๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊๊