提交时间:2024-03-09 17:17:59

运行 ID: 137059

# include <bits/stdc++.h> using namespace std ; double dot [1000] ; int main ( ) { int n , m , w , h ; cin >> m ; while ( m -- ) { cin >> n >> w >> h ; for ( int j = 1 ; j <= n ; j ++ ) { cin >> dot [j] ; } sort ( dot + 1 , dot + n + 1 , greater <double> ( ) ) ; double len = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { len += w * sqrt ( dot [j] * dot [j] - 1 ) ; if ( len >= h ) { cout << j << endl ; break ; } } } return 0 ; }