Submission #1193071

#TimeUsernameProblemLanguageResultExecution timeMemory
1193071NomioRice Hub (IOI11_ricehub)C++20
17 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int besthub(int R, int L, int X[], ll B) { int ans = 0; for(int i = 0; i < R; i++) { vector<int> v; for(int j = 0; j < R; j++) { v.push_back(abs(X[i] - X[j])); } sort(v.begin(), v.end()); int cnt = 0, s = 0, j = -1; while(s + v[j + 1] <= B) { j++; s += v[j]; cnt++; } ans = max(cnt, 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...