fork download
  1. #include<bits/stdc++.h>
  2. #define f1(i, n) for(ll i=1;i<=n;++i)
  3. #define f0(i, n) for(ll i=0;i<n;++i)
  4. #define ull unsigned long long
  5. #define ll long long
  6. #define rev(a) reverse(a.begin(),a.end())
  7. #define all(x) x.begin(),x.end()
  8. #define so(A, n) sort(A+1, A+n+1)
  9. using namespace std;
  10. const int maxn = 200010;
  11. const int N = 1e6 + 1;
  12.  
  13. void solve2() {
  14. ll n, k;
  15. cin >> n >> k;
  16. ll A[n + 1];
  17. f1(i, n) cin >> A[i];
  18. ll left = 1, right = LLONG_MAX - 1, res = 0;
  19. while (left <= right) {
  20. ll mid = (left + right) / 2, cnt = 0;
  21. for (int i = 1; i <= n; ++i) {
  22. cnt += A[i] / mid;
  23. }
  24. if (cnt >= k) {
  25. res = max(res, mid);
  26. left = mid + 1;
  27. }
  28. else {
  29. right = mid - 1;
  30. }
  31. }
  32. cout << res;
  33. }
  34. int main()
  35. {
  36. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  37.  
  38. // freopen("pay.inp","r",stdin);
  39. // freopen("pay.out","w",stdout);
  40.  
  41.  
  42.  
  43. return 0;
  44. }
  45.  
  46.  
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty