Submission #406491

#TimeUsernameProblemLanguageResultExecution timeMemory
406491IwanttobreakfreeJelly Flavours (IOI20_jelly)C++17
0 / 100
2 ms204 KiB
#include "jelly.h" #include <vector> #include <algorithm> using namespace std; int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) { int n=a.size(); if(y==0){ sort(a.begin(),a.end()); int cont=0; while(x&&cont<n){ x-=a[cont]; cont++; } return cont; } return n; }
#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...