# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561577 | 2022-05-13T07:40:03 Z | PiejanVDC | Jelly Flavours (IOI20_jelly) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "jelly.h" using namespace std; int find_maximum_unique(int x, int y, vector<int>a, vector<int>b) { int ans = 0; vector<bool>vis(n,0); vector<pair<int,int>>v(n); for(int i = 0 ; i < n ; i++) v[i].first = a[i], v[i].second = i; sort(v.begin(),v.end()); for(auto z : v) if(x >= z.first) x -= z.first, vis[z.second] = 1, ans++; for(int i = 0 ; i < n ; i++) v[i].first = b[i], v[i].second = i; sort(v.begin(),v.end()); for(auto z : v) if(y >= z.first && !vis[z.second]) y -= z.first, vis[z.second] = 1, ans++; return ans; }