제출 #1202099

#제출 시각아이디문제언어결과실행 시간메모리
1202099SofiatpcJelly Flavours (IOI20_jelly)C++20
0 / 100
1 ms328 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();
	int ans = 0;
	sort(a.begin(),a.end());

	for(int i = 0; i < n; i++){
		if(min(x,y) >= a[i]){
			if(x < y)x -= a[i];
			else y -= a[i];
			ans++;
		}else if(max(x,y) >= a[i]){
			if(x > y)x -= a[i];
			else y -= a[i];
			ans++;
		}
	}
	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...