fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7.     int x = 1;
  8.     while (b) {
  9.         if (b & 1) x *= a;
  10.         a *= a;
  11.         b >>= 1;
  12.     }
  13.     return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24. vector<int> a;
  25.  
  26. bool isPossible(int n, int k, int mid){
  27.  
  28. 	for(int i=0; i<n; i++){
  29. 		if(a[i] > mid) return false;
  30. 		int dif = mid - a[i];
  31. 		k -= dif;
  32. 	}
  33.  
  34. 	return k<=0;
  35. }
  36. void consistency(int n, int k){
  37.  
  38. 	int s = 0, e = INF;
  39.  
  40. 	while(s<e){
  41. 		int mid = s + (e-s)/2;
  42. 		if(isPossible(n, k, mid)){
  43. 			e = mid;
  44. 		}
  45. 		else s = mid+1;
  46. 	}
  47.  
  48. 	cout << s << endl;
  49.  
  50.  
  51. }
  52.  
  53. void solve() {
  54.  
  55.     int n, k;
  56.     cin>>n >> k;
  57.  
  58.     a.resize(n);
  59.     for(int i=0; i<n; i++) cin >> a[i];
  60.  
  61.     consistency(n, k);
  62.  
  63.  
  64. }
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int32_t main() {
  71.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  72.  
  73.     int t = 1;
  74.     cin >> t;
  75.     while (t--) {
  76.         solve();
  77.     }
  78.  
  79.     return 0;
  80. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
3
5 25
7 5 1 9 1
3 3
1 2 3
1 3
1
stdout
copy 
10
3
4
https://ideone.com/Yyo8Mm
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!