Submission #69493341


Source Code Expand

#include<bits/stdc++.h>
#define N 100005
using namespace std;
int T,n,k,x,a[N];
struct node{
	double v;int cnt;
	bool operator<(const node &a)const{
		return v<a.v;
	}
};
priority_queue<node>q;
signed main(){
	cin>>T;
	while(T--){
		while(!q.empty())q.pop();
		cin>>n>>k>>x;
		for(int i=1;i<=n;++i)cin>>a[i],q.push({a[i],1});
		while(1){
			node c=q.top();q.pop();
			if(k<c.cnt){
				q.push({c.v/2,k*2});q.push({c.v,c.cnt-k});
				break;
			}
			else q.push({c.v/2,c.cnt*2}),k-=c.cnt;
		}
		double ans=0;
		while(1){
			node c=q.top();q.pop();
			if(x<=c.cnt){
				ans=c.v;break;
			}
			else x-=c.cnt;
		}
		printf("%.12lf\n",ans);
	}
	return 0;
}

Submission Info

Submission Time
Task E - Cut in Half
User Cute_yhb
Language C++ 20 (gcc 12.2)
Score 475
Code Size 685 Byte
Status AC
Exec Time 181 ms
Memory 5784 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:17:59: warning: narrowing conversion of ‘a[i]’ from ‘int’ to ‘double’ [-Wnarrowing]
   17 |                 for(int i=1;i<=n;++i)cin>>a[i],q.push({a[i],1});
      |                                                        ~~~^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 475 / 475
Status
AC × 1
AC × 36
Set Name Test Cases
Sample sample_01.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, random_31.txt, random_32.txt, random_33.txt, random_34.txt, random_35.txt, sample_01.txt
Case Name Status Exec Time Memory
random_01.txt AC 178 ms 5660 KiB
random_02.txt AC 105 ms 4732 KiB
random_03.txt AC 161 ms 5604 KiB
random_04.txt AC 108 ms 4632 KiB
random_05.txt AC 181 ms 5680 KiB
random_06.txt AC 141 ms 5784 KiB
random_07.txt AC 162 ms 5780 KiB
random_08.txt AC 139 ms 5552 KiB
random_09.txt AC 155 ms 3728 KiB
random_10.txt AC 150 ms 3696 KiB
random_11.txt AC 149 ms 3812 KiB
random_12.txt AC 142 ms 3712 KiB
random_13.txt AC 156 ms 3900 KiB
random_14.txt AC 151 ms 3868 KiB
random_15.txt AC 147 ms 3800 KiB
random_16.txt AC 142 ms 3728 KiB
random_17.txt AC 89 ms 5544 KiB
random_18.txt AC 89 ms 5576 KiB
random_19.txt AC 89 ms 5612 KiB
random_20.txt AC 87 ms 5608 KiB
random_21.txt AC 87 ms 5556 KiB
random_22.txt AC 85 ms 5776 KiB
random_23.txt AC 81 ms 5544 KiB
random_24.txt AC 78 ms 5652 KiB
random_25.txt AC 81 ms 5652 KiB
random_26.txt AC 77 ms 5540 KiB
random_27.txt AC 78 ms 5784 KiB
random_28.txt AC 71 ms 5652 KiB
random_29.txt AC 107 ms 5780 KiB
random_30.txt AC 100 ms 5548 KiB
random_31.txt AC 29 ms 5540 KiB
random_32.txt AC 1 ms 3760 KiB
random_33.txt AC 121 ms 3720 KiB
random_34.txt AC 121 ms 3688 KiB
random_35.txt AC 121 ms 3696 KiB
sample_01.txt AC 1 ms 3704 KiB