fork download
  1. // LonggVuz.
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. // Legendary Grandmaster
  5. void End(){
  6. cerr << "=> Smoothly Finished! Time taken: ";
  7. cerr << (0.001 * clock()) << "s" << string(25, '\t');
  8. }
  9. #define Sonic() cin.tie(NULL) -> sync_with_stdio(false);
  10. #define fix(x) fixed << setprecision(x)
  11. #define all(x) begin(x), end(x)
  12. #define len(x) (int)x.size()
  13. #define ms(a, x) memset(a, x, sizeof(a))
  14. #define bit(n, x) (n >> x & 1)
  15. #define pii pair<int, int>
  16. #define fi first
  17. #define se second
  18. #define pb push_back
  19. #define is insert
  20. #define el '\n'
  21. #define ld long double
  22. #define int int64_t
  23. #define use(x) freopen(x".inp", "r", stdin); freopen(x".out", "w", stdout);
  24.  
  25. const int mod = 1e9 + 7;
  26. const int oo = 1e18 + 7;
  27. const int mxn = 1e5 + 7;
  28.  
  29. int n;
  30. pii a[mxn];
  31.  
  32. bool cmp(pii a, pii b){
  33. int x = a.fi - a.se, y = b.fi - b.se;
  34. if(x <= 0 and y >= 0) return 1;
  35. if(x >= 0 and y <= 0) return 0;
  36. if(x <= 0 and y <= 0) return a.fi < b.fi;
  37. if(x >= 0 and y >= 0) return a.se > b.se;
  38. return 1;
  39. }
  40.  
  41. bool check(int x){
  42. for(int i=1; i<=n; i++){
  43. if(x < a[i].fi) return 0;
  44. x = x - a[i].fi + a[i].se;
  45. }return x >= 0;
  46. }
  47.  
  48. void LonggVuz(){
  49. cin >> n;
  50. for(int i=1; i<=n; i++){
  51. cin >> a[i].fi;
  52. }
  53. for(int i=1; i<=n; i++){
  54. cin >> a[i].se;
  55. }
  56. sort(a+1, a+n+1, cmp);
  57. int res = 0, l = 1, r = 1e9;
  58. while(l <= r){
  59. int mid = (l + r) / 2;
  60. if(check(mid)){
  61. res = mid;
  62. r = mid - 1;
  63. }else l = mid + 1;
  64. }cout << res;
  65. }
  66.  
  67. signed main(){
  68. Sonic();
  69. //use("prjchain")
  70. int TC = 1; //cin >> TC;
  71. while(TC--) LonggVuz();
  72.  
  73. End();
  74. }
Success #stdin #stdout #stderr 0.01s 5284KB
stdin
6
6 3 1 2 4 9
2 4 3 1 3 2
stdout
11
stderr
=> Smoothly Finished! Time taken: 5.294s