제출 #1168961

#제출 시각아이디문제언어결과실행 시간메모리
1168961aentrenusJelly Flavours (IOI20_jelly)C++20
0 / 100
1 ms328 KiB
#include "jelly.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
#define all(a) a.begin(), a.end()
#define print(a) for (auto elem:a) cout<<elem<<' '; cout<<'\n'
#define segprep(b) resize(1<<((int)ceil(log2(b.size()))+1))
#define FOR(a) for (int _ = 0; _ < a; _++)

int n;

int solve3(int &x, vi &a){
	sort(all(a));
	for (int i = 0; i < n; i++){
		if (x >= a.at(i)){
			x -= a.at(i);
			continue;
		}
		return i;
	}
	return n;
}

int find_maximum_unique(int x, int y, vi a, vi b) {
	n = a.size();

	if (y == 0) return solve3(x, a);
	return 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...