Submission #959999

#TimeUsernameProblemLanguageResultExecution timeMemory
959999CookieGym Badges (NOI22_gymbadges)C++14
100 / 100
141 ms22208 KiB
#include<bits/stdc++.h> #include<fstream> using namespace std; #define sz(a) (int)a.size() #define ALL(v) v.begin(), v.end() #define ALLR(v) v.rbegin(), v.rend() #define ll long long #define pb push_back #define forr(i, a, b) for(int i = a; i < b; i++) #define dorr(i, a, b) for(int i = a; i >= b; i--) #define ld long double #define vt vector #include<fstream> #define fi first #define se second #define pll pair<ll, ll> #define pii pair<int, int> #define mpp make_pair const ld PI = 3.14159265359, prec = 1e-9;; //using u128 = __uint128_t; //const int x[4] = {1, 0, -1, 0}; //const int y[4] = {0, -1, 0, 1}; const ll mod = 1e9 + 69, pr = 31; const int mxn = 5e5 + 5, mxq = 1e5 + 5, sq = 300, mxv = 5e4 + 1; //const int base = (1 <<18); const ll inf = 1e18 + 5, neg = -69420, inf2 = 1e14; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); // have fun! // <3; int n; pll p[mxn + 1]; bool cmp(pll a, pll b){ return(a.fi + a.se < b.fi + b.se); } void solve(){ cin >> n; for(int i = 1; i <= n; i++)cin >> p[i].fi; for(int i = 1; i <= n; i++)cin >> p[i].se; sort(p + 1, p + n + 1, cmp); priority_queue<ll, vt<ll>>pq; ll tot = 0; for(int i = 1; i <= n; i++){ if(tot > p[i].se){ if(pq.top() > p[i].fi){ tot -= pq.top(); tot += p[i].fi; pq.pop(); pq.push(p[i].fi); } }else{ pq.push(p[i].fi); tot += p[i].fi; } } cout << sz(pq); } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); //freopen("netw.inp", "r", stdin); //freopen("netw.out", "w", stdout); int ttt; ttt = 1; while(ttt--){ solve(); } return(0); } /* 1 5 7 2 1 1 1 3 1 2 2 2 3 4 2 4 2 4 2 1 5 5 3 5 2 5 3 2 7 3 3 1 1 1 1 1 2 2 1 3 3 3 1 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...