| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1139739 | tone_alexandru | Swimming competition (LMIO18_plaukimo_varzybos) | C++20 | 225 ms | 4328 KiB |
#include <bits/stdc++.h>
using namespace std;
int v[1000005];
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 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... | ||||
