lalalalalalalaalalla

Untitled

Dec 15th, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.20 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #include <string>
  4. #include <iomanip>
  5. #include <queue>
  6. #include <cmath>
  7. #include <algorithm>
  8. #include <tuple>
  9. #include <iomanip>
  10. #include <stdio.h>
  11. #include <numeric>
  12. #include <map>
  13. #include <bitset>
  14. #include <set>
  15. #include <stack>
  16. #include <queue>
  17.  
  18. /*
  19. #pragma GCC optimize("Ofast,no-stack-protector")
  20. #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
  21. #pragma GCC optimize("unroll-loops")
  22. #pragma GCC optimize("fast-math")
  23. #pragma GCC optimize("section-anchors")
  24. #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
  25. #pragma GCC optimize("vpt")
  26. #pragma GCC optimize("rename-registers")
  27. #pragma GCC optimize("move-loop-invariants")
  28. #pragma GCC optimize("unswitch-loops")
  29. #pragma GCC optimize("function-sections")
  30. #pragma GCC optimize("data-sections")
  31. #pragma GCC optimize("branch-target-load-optimize")
  32. #pragma GCC optimize("branch-target-load-optimize2")
  33. #pragma GCC optimize("btr-bb-exclusive")
  34. */
  35.  
  36. //#define int long long
  37. #define ll long long
  38. #define ull unsigned long long
  39. #define all(a) a.begin(), a.end()
  40. #define pii pair<int, int>
  41. #define pb push_back
  42. #define ld long double
  43.  
  44.  
  45. using namespace std;
  46.  
  47. //const int INF = 1e13;
  48. //const int mod = 2600000069;
  49. //const int p = 179;
  50.  
  51. signed main() {
  52. ios_base::sync_with_stdio(0);
  53. cin.tie(0);
  54. cout.tie(0);
  55. int n, m, l;
  56. cin >> n >> m >> l;
  57. multiset<int, greater<int>> a;
  58. set<int> was;
  59. vector<int> b(m);
  60. int x;
  61. for (int i = 0; i < n; i++) {
  62. cin >> x;
  63. a.insert(x);
  64. }
  65. for (int i = 0; i < m; i++) {
  66. cin >> b[i];
  67. if (was.count(b[i])) continue;
  68. was.insert(b[i]);
  69. auto it = a.lower_bound(b[i]);
  70. if (it == a.end()) {
  71. cout << i;
  72. return 0;
  73. }
  74. // cout << *it << "\n";
  75. if (l < b[i] - *it) {
  76. cout << i;
  77. return 0;
  78. }
  79. l -= b[i] - *it;
  80. // cout << a.size() << "\n";
  81. a.erase(it);
  82. }
  83. cout << m;
  84. }
  85. /*
  86. 6 8 179
  87. 4 9 23 15 43 7
  88. 3 10 14 7 3 8 7 3
  89. -> 0
  90.  
  91. 5 8 5
  92. 5 3 8 14 1
  93. 10 7 3 7 12 3 3 6
  94. -> 4
  95.  
  96. 2 2 4
  97. 6 13
  98. 8 10
  99. -> 1
  100. */
Add Comment
Please, Sign In to add comment