Submission #406429

#	Time	Username	Problem	Language	Result	Execution time	Memory
406429		victoriad	Jelly Flavours (IOI20_jelly)	C++14	14 / 100	2 ms	460 KiB

jelly

#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
	x+=y;
		sort(a.begin(),a.end());
		int r=0;
		for(int i=0;i<n;i++){
			if(a[i]<=x){
				r++;
				x-=a[i];
			}
			else{
				break;
			}
		}
		return r;
}

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