#include <iostream>#include <algorithm>#include <vector>#include <cmath>using namespace std;bool compare(double a, double b){ return a>b;}int main(){int k;cin>>k;while(k–){vector<double> i_vector;i_vector.clear();int m = 0;int count = 0;double length = 0;cin>>m;for(int i = 0; i<m; i++){double n;cin>>n;i_vector.push_back(n);}sort(i_vector.begin(), i_vector.end(), compare);for(vector<double>::iterator it = i_vector.begin(); it!=i_vector.end(); it++){length += sqrt(pow(*it, 2)-1);if(length>=10){count++;break;}count++;}cout<<count<<endl;}return 0;}
，代替你主持夕阳的葬礼。
