Submission #1027765

#TimeUsernameProblemLanguageResultExecution timeMemory
1027765vjudge1Rice Hub (IOI11_ricehub)C++17
0 / 100
1075 ms1372 KiB
#include <bits/stdc++.h> using namespace std; int besthub(int n, int l, int x[], long long b) { long long max_rez=-1, sol=1; for(int i=0; i<n; i++) { multiset<int>s; for(int j=0; j<n; j++) { s.insert(abs(x[j]-x[i])); } long long sum=0, rez=0; for(auto it=s.begin(); it!=s.end(); it++) { sum+=(*it); if(sum>b) { break; } rez++; } if(max_rez<rez) { rez=max_rez; sol=x[i]; } } return sol; } /*int main() { int r, l; long long b; cin>>r>>l; int x[r]; for(int i=0; i<r; i++) cin>>x[i]; cin>>b; cout<<besthub(r, l, x, b); 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...