Submission #1270732

#TimeUsernameProblemLanguageResultExecution timeMemory
1270732goulthenGym Badges (NOI22_gymbadges)C++20
42 / 100
95 ms196308 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 = 5e3+10; const int INF = 1e18 + 5; array<int,3> a[MAXN]; int dp[MAXN][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); rep(j,1,n) dp[0][j] = INF; rep(i,1,n) { rep(j,0,n) { dp[i][j] = dp[i-1][j]; if (j>0 && dp[i-1][j-1] <= a[i][2]) dp[i][j] = min(dp[i][j], dp[i-1][j-1] + a[i][1]); } } per(j,n,1) { if (dp[n][j] < INF) { cout << j << '\n'; break; } } 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...