Submission #56258669

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#define endl "\n"
# define int long long
using namespace std;
const int MOD = 1e9+7;
void solve() {
    int n,m; cin >> n >> m;
    vector<int> p(n);
    for(int i=0;i<n;++i) cin >> p[i];
    int maxv = *max_element(p.begin(),p.end());
    function<bool(int)> ok = [&](int mid){
        int cost = 0;
        for(int i=0;i<n;++i){
            cost+=min(mid,p[i]);
        }
        if(cost>m) return false;
        else return true;
    };
    int s=0,e=maxv+1;
    while(e-s>1){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#define endl "\n"
# define int long long
using namespace std;
const int MOD = 1e9+7;

void solve() {
    int n,m; cin >> n >> m;
    vector<int> p(n);
    for(int i=0;i<n;++i) cin >> p[i];
    int maxv = *max_element(p.begin(),p.end());
    function<bool(int)> ok = [&](int mid){
        int cost = 0;
        for(int i=0;i<n;++i){
            cost+=min(mid,p[i]);
        }
        if(cost>m) return false;
        else return true;
    };
    int s=0,e=maxv+1;
    while(e-s>1){
        int m = s + (e-s)/2;
        if(ok(m)) s = m;
        else e = m-1;
    }
    if(ok(e)){
        if(e==maxv+1) cout << "infinite" << endl;
        else cout << e << endl;
    }else cout << s << endl;
}

signed main() {
    int __ = 1;
    // cin >> __;
    while (__--) solve();
    return 0;
}

Submission Info

Judge Result