# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207493 | ricardsjansons | Watching (JOI13_watching) | C++20 | 1 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,p,q;
cin>>n>>p>>q;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
if(n<=p+q){
cout<<1;
return 0;
}
sort(a,a+n);
int d[n-1];
for(int i=1;i<n;i++){
d[i-1]=a[i]-a[i-1];
}
sort(d,d+n-1);
int m=n-p-q;
int w=d[m-1]+1;
if(m<=q){
w=(w+1)/2;
}
cout<<w;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |