题解 | #Kevin逛超市 2 (简单版本)#

#include #include #include #include using namespace std; vector q; int t; int n,x,y; int main(){ cin>>t; while(t--){ cin>>n>>x>>y; int d; //别忘了清空..... q.clear(); for(int i=0;i<n;i++){cin>>d; q.push_back(d); } sort(q.begin(),q.end()); double s=0; for(int i=0;i<n-2;i++)s+=q[i];

double s1=max(0,q[n-1]-y)+q[n-2]x0.01+s; double s2=max(0,q[n-2]-y)+q[n-1]x0.01+s;

cout<<fixed<<setprecision(12)<<min(s1,s2)<<endl; } return 0; }