-
Notifications
You must be signed in to change notification settings - Fork 0
/
BOJ_13241.cpp
53 lines (47 loc) · 902 Bytes
/
BOJ_13241.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<iostream>
#include<vector>
#include<list>
#include<queue>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstring>
#include<functional>
#include<cstdio>
#include<stack>
#pragma warning(disable:4996)
#define INTMAX 0x7fffffff
#define gets(x) cin.getline(x,sizeof(x))
#define square(x) (x)*(x)
using namespace std;
using lld = long long;
lld n, m, Max = -959595;
vector<lld> v(1000000, 0);
lld bs(lld st, lld fi) {
lld sum = 0;
if (st > fi)
return Max;
lld tmp = (st + fi) / 2;
for (int i = 0; i < n; i++) {
if (v[i] < tmp) continue;
sum += v[i] - tmp;
}
if (sum >= m)
if(Max<tmp)
Max = tmp;
if (sum < m)
bs(st, tmp - 1);
else
bs(tmp + 1, fi);
}
int main(void) {
lld tmp;
scanf("%lld%lld", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld", &v[i]);
tmp = max<lld>(tmp, v[i]);
}
printf("%lld\n",bs(0, tmp));
// system("pause");
return 0;
}