伐木 题解

userId_undefined

o͇͇͇ด้้้蠬蠭饗鑙鑴ø¼³

出道萌新

2024-08-04 16:55:31

发布于：广东

6阅读
0回复
0点赞
#include<bits/stdc++.h>
using namespace std;
int a,b[1000005];
long long s;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	scanf("%d%lld",&a,&s);
	for(int i=0;i<a;i++){
		scanf("%d",&b[i]);
	}
	sort(b,b+a,cmp);
	long long i=0,h=b[0],ans=1,sum=0;
	while(true){
		if((b[i]-b[i+1])*ans>=s){
			h-=s/ans;
			break;
		}else{
			h=b[i+1];
			s-=(b[i]-b[i+1])*ans;
			i++;
			ans++;
            sum=-1;
		}
	}
	printf("%d",h+sum);
	return 0;
}

伐木
伐木原题

userId_undefined
去预览
0/2000
暂无数据

这里空空如也

热门讨论