Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<bits/stdc++.h>using namespace std;int a[100005];struct node{double l;int num;double now;bool operator <(const node &bb)const{return now<bb.now;}};priority_queue <node> q;int main(){int n,m,k;scanf("%d%d%d",&m,&n,&k);a[0]=0;for(int i=1;i<=m;i++){scanf("%d",&a[i]);q.push(node{a[i]-a[i-1],1,a[i]-a[i-1]});}while(k--){node tmp=q.top();// cout<<tmp.num<<endl;q.pop();tmp.num+=1;tmp.now=tmp.l/tmp.num;q.push(tmp);}printf("%.1f\n",q.top().now);