Submission #518574

#TimeUsernameProblemLanguageResultExecution timeMemory
518574aurimsSwimming competition (LMIO18_plaukimo_varzybos)C++14
0 / 100
1 ms332 KiB
#include <algorithm> #include <iostream> using namespace std; typedef long long ll; 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 ll mn = 1e6+1; ll 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((ll)ans, mx-mn); track = 0; } } cout << ans; 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...