Submission #1139736

#TimeUsernameProblemLanguageResultExecution timeMemory
1139736tone_alexandruSwimming competition (LMIO18_plaukimo_varzybos)C++20
0 / 100
33 ms1096 KiB
#include <bits/stdc++.h> using namespace std; int v[200005]; int main() { int n, a, b; cin>>n>>a>>b; for(int i=0; i<n; i++) cin>>v[i]; if(a == b) { sort(v, v+n); int maxx = 0; for(int i=0; i<n; i++) { int eli = v[i], elf = v[i + a - 1]; maxx = max(maxx, elf - eli); i += a; i--; } cout<<maxx; } 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...