This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int t[40];
for(int i = 0; i < n; i++) cin >> t[i];
sort(t, t+n);
// bruteforce
int ans = -1;
int k = n/a; // subt #1 states a == b
for(int i = 1; i <= k; i++)
{
ans = max(ans, t[n/i - 1] - t[n - i*a]);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |