Submission #1270743

#TimeUsernameProblemLanguageResultExecution timeMemory
1270743goulthenGym Badges (NOI22_gymbadges)C++20
100 / 100
127 ms20052 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define rep(i,a,b) for (int i = a; i <= b; i++) #define per(i,a,b) for (int i = a; i >= b; i--) #define fi first #define se second #define pii pair<int,int> #define pb push_back const int MAXN = 5e5+10; const int INF = 1e18 + 5; array<int,3> a[MAXN]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int n;cin >> n; rep(i,1,n) cin >> a[i][1]; rep(i,1,n) cin >> a[i][2]; rep(i,1,n) a[i][0] = a[i][1] + a[i][2]; sort(a+1,a+n+1); priority_queue<int> pq; int s = 0; rep(i,1,n) { if (s <= a[i][2]) { s+=a[i][1]; pq.push(a[i][1]); } else { if (a[i][1] < pq.top()) { s-= pq.top(); pq.pop(); s+= a[i][1]; pq.push(a[i][1]); } } } cout << pq.size() << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...