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. 	int sum = 0;
  29. 	for(int i=0; i<n; i++) sum += a[i];
  30.  
  31. 	int steps = 0;
  32. 	for(int i=n-1; i>=1; i--){
  33.  
  34. 		if(steps > mid) return false;
  35. 		if(sum <= k) return true;
  36.  
  37. 		if(a[i] > a[0]){
  38. 			int diff = a[i]-a[0];
  39. 			sum -= diff;
  40. 			steps++;
  41. 		}
  42. 	}
  43.  
  44. 	//* Both working ?
  45. 	// int remSum = k - sum;
  46. 	int remSum = sum - k;
  47.  
  48. 	int remSteps = remSum;
  49.  
  50. 	return steps + remSteps <= mid;
  51.  
  52. }
  53.  
  54. int consistency(int n, int k){
  55. 	if(n==1){
  56. 		if(a[0] <= k) return 0;
  57. 		return a[0]-k;
  58. 	}
  59.  
  60. 	sort(begin(a), end(a));
  61.  
  62. 	int s = 0, e = INF;
  63. 	while(s<e){
  64. 		int mid = s + (e-s)/2;
  65. 		if(isPossible(n, k, mid)){
  66. 			e = mid;
  67. 		}
  68. 		else s = mid+1;
  69. 	}
  70.  
  71. 	return e;
  72. }
  73.  
  74. void solve() {
  75.  
  76.     int n, k;
  77.     cin>>n >> k;
  78.  
  79.     a.resize(n);
  80.     for(int i=0; i<n; i++) cin >> a[i];
  81.  
  82.     cout << consistency(n, k) << endl;
  83.  
  84.  
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91. int32_t main() {
  92.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  93.  
  94.     int t = 1;
  95.     cin >> t;
  96.     while (t--) {
  97.         solve();
  98.     }
  99.  
  100.     return 0;
  101. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
5
5 5
2 3 4 6 3
1 10
20
2 69
6 9
7 8
1 2 1 3 1 2 1
10 1
1 2 3 1 2 6 1 6 8 10
stdout
copy 
9
10
0
2
16
https://ideone.com/tih2Yt
language:
C++14 (gcc 8.3)
created:
4 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!