Submission #1184858

#TimeUsernameProblemLanguageResultExecution timeMemory
1184858asli_bgGym Badges (NOI22_gymbadges)C++20
0 / 100
2090 ms12264 KiB
#include <bits/stdc++.h> using namespace std; #define int long long typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vii; typedef vector<bool> vb; #define fi first #define se second #define pb push_back #define mid (l+r)/2 #define all(x) x.begin(),x.end() #define FOR(i,a) for(int i=0;i<(a);i++) #define FORE(i,a,b) for(int i=(a);i<(b);i++) #define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl; #define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl; #define sp <<" "<< #define DEBUG(x) cout<<(#x) sp x<<endl const int INF=1e18; const int MAXN=5e5+5; pii dp[MAXN]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin>>n; vii a(n+1); FORE(i,1,n+1) cin>>a[i].fi; FORE(i,1,n+1) cin>>a[i].se; int res=1; for(int i=1;i<(1<<n);i++){ vii vec; for(int bt=0;bt<n;bt++){ if(i&(1<<bt)) vec.pb(a[bt+1]); } sort(all(vec)); int cur=0; bool f=true; FOR(j,vec.size()){ if(cur>vec[j].se){ f=false; break; } cur+=vec[j].fi; } if(f){ res=max(res,(int) vec.size()); } } cout<<res<<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...