洛谷 P1873 [COCI 2011/2012 #5] EKO / 砍树

Shoko0116

已于 2022-03-08 14:51:29 修改

阅读量539

点赞数

分类专栏：洛谷文章标签：算法 leetcode

于 2022-01-18 19:27:19 首次发布

本文链接：https://blog.csdn.net/qq_24997277/article/details/122566722

版权

洛谷专栏收录该内容

1 篇文章 0 订阅

订阅专栏

P1873砍树

Ideas

算法：二分答案
在这里插入图片描述

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() 
{
 int n, m;
 cin >> n >> m;
 vector<int> a(n);
 for (int i = 0; i < n; i++)
  cin >> a[i];
 int l = -1, r = 1000000005, mid;
 while (r > l)
 {
  mid = (r + l + 1) / 2;
  ll sum = 0;
  for (auto c : a)
   if (c > mid)
    sum += (c - mid);
  if (sum >= m)
   l = mid;
  else
   r = mid - 1;
 }
 cout << l << '\n';
 return 0;
}

python超时了…

n, m = map(int, input().split())
nums = list(map(int, input().split()))

l = -1
r = max(nums)

while(r > l):
    
    mid = (r + l + 1) // 2

    p = False
    s = 0
    for i in range(n):
        if(nums[i] > mid):
            s += nums[i] - mid
    if(s >= m):
        p = True
    if p: l = mid
    else: r = mid - 1
    

print(l)