Submission #409928

#TimeUsernameProblemLanguageResultExecution timeMemory
409928Dan4Life쌀 창고 (IOI11_ricehub)C++17
68 / 100
1085 ms848 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long int besthub(int n, int m, int a[], ll k) { ll ans = 0; for(int i = 0; i < n; i++){ vector<int> v; v.clear(); for(int j = 0; j < n; j++) v.push_back(abs(a[i]-a[j])); sort(v.begin(), v.end()); for(int i = 1; i < n; i++) v[i]+=v[i-1]; int pos = upper_bound(v.begin(), v.end(), k)-v.begin(); if(ans<pos)ans=pos; } 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...