# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886966 | efedmrlr | Gym Badges (NOI22_gymbadges) | C++17 | 345 ms | 29892 KiB |
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>
#define int long long int
#define MP make_pair
#define REP(i,n) for(int (i) = 0; (i)<(n); (i)++)
#define pb push_back
const int N = 5e3+5;
const int MOD = 1e9+7;
const int INF = 1e17;
using namespace std;
void fastio() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
}
int n,m,q;
vector<int> dp(N, INF), dpnew(N, INF);
vector<int> L, X;
vector<array<int,2> > srt;
bool comp(array<int,2> &x, array<int,2> &y) {
return x[0] + x[1] < y[0] + y[1];
}
void solve() {
cin>>n;
srt.resize(n);
L.assign(n+1, 0);
X.assign(n+1, 0);
REP(i,n) cin>>srt[i][0];
REP(i,n) cin>>srt[i][1];
dp[0] = 0;
sort(srt.begin(), srt.end(), comp);
REP(i,n) {
X[i + 1] = srt[i][0];
L[i + 1] = srt[i][1];
}
priority_queue<int> pq;
int last = 0;
for(int i = 1; i<=n; i++) {
pq.push(X[i]);
if(last > L[i]) {
last -= pq.top();
pq.pop(); // pop worst
}
last += X[i];
}
cout<<pq.size()<<"\n";
}
signed main() {
// fastio();
solve();
}
Compilation message (stderr)
# | 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... |