提交时间:2024-03-09 17:11:34

运行 ID: 137047

#include<bits/stdc++.h> using namespace std; int m,n,l=20,s=0; double ri[1005]; int main(){ cin>>m; for(int i=1;i<=m;i++ ){ cin>>n; for(int i=1;i<=n;i++) cin>>ri[i]; sort(ri+1,ri+n+1,greater<double>()); for(int j=1;j<=n;j++){ if(l - 2 * sqrt(ri[j] * ri[j] - 1) <= 0){ s++; break; } l -= 2 * sqrt(ri[j] * ri[j] - 1); s++; if(l - 2 * sqrt(ri[j] * ri[j] - 1) <= 0){ s++; break; } } cout<<s<<endl; } return 0; } /* 2 5 2 3.2 4 4.5 6 10 1 2 3 1 2 1.2 3 1.1 1 2 */