Submission #1229576

#TimeUsernameProblemLanguageResultExecution timeMemory
1229576maya_sJelly Flavours (IOI20_jelly)C++20
10 / 100
1 ms328 KiB
#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();
    sort(a.begin(), a.end());
    ll ans = y/b[0], sum = 0;
    for(ll i = 0; i < n; i++){
        sum += a[i];
        if(sum > x) return min(n, i+ans);
    }
    return n;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...