Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- typedef long long ll;
- using namespace __gnu_pbds;
- using namespace std;
- #define pb push_back
- //#define mp make_pair
- #define ff first
- #define ss second
- #define len(v) ((int)v.size())
- #define all(v) v.begin(), v.end()
- #define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
- ll mod=998244353;
- void io(){
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- cout.tie(NULL);
- #ifndef ONLINE_JUDGE
- freopen("input_6.txt","r",stdin);
- freopen("output_6.txt","w",stdout);
- #endif
- }
- const int N = 1e6 + 5;
- long long a[N];
- ll summ;
- int main()
- {
- io();
- int n, k;
- cin >> n >> k;
- for(int i = 0; i<n; i++) {
- cin >> a[i];
- summ+=a[i];
- }
- long long l = 0, r = 1e18, m;
- while( l+1 < r) {
- long long sum = 0;
- m = l + r;
- m = m / 2;
- for(int i = 0; i < n; i++) {
- if(a[i] > m)
- sum += m;
- else
- sum += a[i];
- }
- if((sum / m) >= k)
- l = m;
- else r = m;
- }
- cout << l;
- }
Add Comment
Please, Sign In to add comment