fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28. bool check(int a[],int n, ll time, int k){
  29. ll cnt = 0;
  30. for(int i = 0; i < n; i++){
  31. cnt += time / a[i];
  32. if(cnt >= k)
  33. return true;
  34. if(a[i] > time) break;
  35. }
  36. return false;
  37. }
  38.  
  39. int main(){
  40. #ifndef ONLINE_JUDGE
  41. freopen("input.txt", "r", stdin);
  42. freopen("output.txt", "w", stdout);
  43. #endif
  44. int n, t; cin >> n >> t;
  45. int a[n];
  46. for(int &x : a) cin >> x;
  47. sort(a, a + n);
  48. ll res, l = 0, r = 1ll * a[n-1] * t;
  49. while(l <= r){
  50. ll m = (l + r) / 2;
  51. if(check(a, n, m, t)){
  52. res = m;
  53. r = m - 1;
  54. }
  55. else l = m + 1;
  56. }
  57. cout << res << endl;
  58. return 0;
  59. }
Time limit exceeded #stdin #stdout 5s 5640KB
stdin
Standard input is empty
stdout
Standard output is empty