Submission #886018

#TimeUsernameProblemLanguageResultExecution timeMemory
886018vjudge1Curtains (NOI23_curtains)C++17
0 / 100
0 ms348 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...