用的二分查找,但是还是超时了,求助大佬!
查看原帖
用的二分查找,但是还是超时了,求助大佬!
800751
acmwriter楼主2023/5/16 21:33
#include<bits/stdc++.h>
using namespace std;
int a[1000005];
int n,m;
int main(){
	cin>>n>>m;
	int largest=-1;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(largest<a[i])largest=a[i];
	}
	int right=0,left=largest;
	while(right<=largest){
		int mid=(right+left)/2;
		int sum=0;
		for(int i=0;i<n;i++){
			if(a[i]>mid)sum+=a[i]-mid;
		}
		if(sum>m)right=mid;
		else if(sum<m)left=mid;
		else if(sum==m){
			cout<<mid;
			return 0;
		}
	}
	return 0;
}
2023/5/16 21:33
加载中...