This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin>>n>>k;
vector<pair<ll,ll>> arr(n);
for (int i = 0; i < n; ++i)
{
cin>>arr[i].first;
}
for (int i = 0; i < n; ++i)
{
cin>>arr[i].second;
}
sort(arr.begin(), arr.end());
ll crr = 0;
int ans = 0;
for (int i = 0; i < n; ++i)
{
if (crr<arr[i].first) break;
ans++;
crr+=arr[i].second;
}
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |