Untitled
unknown
plain_text
6 months ago
1.1 kB
2
Indexable
#include <bits/stdc++.h> using namespace std ; #define For(n) for(long long i = 0; i < n; i++) #define endl '\n' #define int long long #define fast() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); //***********************Nah I would win*************************// int bseacrh(int v[] , int n , int x){ int l = 0 , r = n-1 ; while(l<=r){ int mid = (l+r)/2; if(v[mid] == x)return mid; else if(v[mid] < x) l = mid +1; else r = mid-1; } return -1; } bool can(vector<int>& a,vector<int>& b,int mid){ int sum = 0; For(a.size()){ if(a[i] > mid)sum += b[i]; } return sum <= mid; } void Gojo(){ int n;cin>>n; vector<int>a(n),b(n); For(n)cin>>a[i]; For(n)cin>>b[i]; int l = 1, r = *max_element(a.begin(),a.end()), ans = r; while(l <= r){ int mid = (l+r)/2; if(can(a,b,mid)){ ans = mid; r = mid-1; } else l = mid+1; } cout << ans; } signed main () { fast() int Tt =1; cin>>Tt; while (Tt--){ Gojo(); cout << endl; } }
Editor is loading...
Leave a Comment