#include <bits/stdc++.h>
using namespace std;
typedef int ll;
ll dp[2001][10001];
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
ll n = a.size();
vector<ll> c;
ll ans = 0, sum = 0;
for(ll i = 0; i < n; i++){
if(!b[i]) ans++;
else c.push_back(a[i]);
}
sort(c.begin(), c.end());
for(ll i = 0; i < c.size(); i++){
sum += c[i];
if(sum > x) return i+ans;
}
return n;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |