#include <algorithm>
#include <iostream>
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);
int ans = -1;
// bruteforce
// subt #1 states a == b
int mn = 1e6+1;
int mx = -1;
int track = 0;
for(int i = 0; i < n; i++)
{
track++;
if(track == 1) mn = t[i];
if(track == a)
{
mx = t[i];
ans = max(ans, mx-mn);
track = 0;
}
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
324 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
292 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
292 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
324 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
324 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |