# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433273 | tengiz05 | Jelly Flavours (IOI20_jelly) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "jelly.h"
#include <vector>
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
int n = a.size();
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (x >= a[i]) {
x -= a[i];
ans++;
}
}
return ans;
}