제출 #1325037

#제출 시각아이디문제언어결과실행 시간메모리
1325037kasamchiJelly Flavours (IOI20_jelly)C++20
10 / 100
1 ms432 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();

	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]);
}
#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...