Submission #406432

#TimeUsernameProblemLanguageResultExecution timeMemory
406432victoriadJelly Flavours (IOI20_jelly)C++14
10 / 100
2 ms348 KiB
#include "jelly.h" #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> #include <utility> #include <queue> #include <map> #include <iomanip> #include <stack> #include <fstream> using namespace std; int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) { int n = a.size(); sort(a.begin(),a.end()); int r=0; for(int i=0;i<n;i++){ if(a[i]<=x){ r++; x-=a[i]; } else{ break; } } for(int i=0;i<n;i++){ if(b[i]<=y){ r++; y-=b[i]; } else{ break; } if(r>=n)break; } if(r>=n)return n; return r; }
#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...