| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1325035 | kasamchi | Jelly Flavours (IOI20_jelly) | C++20 | 0 ms | 0 KiB |
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n = s.size();
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n && x >= a[i]; i++) {
x -= a[i], ans++;
}
return min(n, ans + y / b[0]);
}
