제출 #336729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336729		northlake	Jelly Flavours (IOI20_jelly)	C++17	10 / 100	3 ms	640 KiB

jelly

#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 answer = 0; int n = a.size();
    // nb from b
    int b_price = b[0];
    answer += y / b_price;
    // nb from a
    sort(a.begin(), a.end());
    int sum = 0; int nb_a = 0; int counter = 0;
    while ((sum + a[counter]) <= x && counter < n) {
        sum += a[counter];
        nb_a += 1;
        counter += 1;
    }
    answer += nb_a;
    // return result
    answer = min(answer, n);
    return answer;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 24
• Subtask 3: 0 / 9
• Subtask 4: 10 / 10
• Subtask 5: 0 / 14
• Subtask 6: 0 / 32