Submission #400885

#TimeUsernameProblemLanguageResultExecution timeMemory
400885DivannyJelly Flavours (IOI20_jelly)C++14
0 / 100
2 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(); sort(a.begin(), a.end()); int i = 0, cont = 0; while (x - a[i] >= 0 && i < n) { if (x - a[i] >= 0) { cont++; x -= a[i]; } i++; } return cont; }
#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...