제출 #418744

#제출 시각아이디문제언어결과실행 시간메모리
418744DivannyJelly Flavours (IOI20_jelly)C++14
0 / 100
1 ms460 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 = a.size(), ans = 0;
	ans += y / b[0];
	sort(a.begin(), a.end());
	int cont = 0, i = 0;
	while (cont + a[i] <= x && i < n)
	{
		cont += a[i];
		i++;
	}
	ans += i;
	return ans;
}
#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...