#include <iostream>
using namespace std;
int main()
{
int n, d, k, may = 0, must = 0;
double e, t;
cin >> n >> e >> d;
for (int i = 0; i < n; i++)
{
cin >> k;
int sum = 0;
for (int j = 0; j < k; j++)
{
cin >> t;
if (t < e)
{
sum++;
}
}
if (sum > (k / 2))
{
k > d ? must++ : may++;
}
}
double x = (double)may / n * 100;
double y = (double)must / n * 100;
printf("%.1f%% %.1f%%", x, y);
return 0;
}
相关文章
- 04-121053 住房空置率
- 04-12CF1053E Euler tour 构造
- 04-12BZOJ 1053 - 反素数ant - [数论+DFS][HAOI2007]
- 04-122018.09.25 codeforces1053E. Euler tour(并查集+st表+模拟)
- 04-121053 Path of Equal Weight (30 分)(******)
- 04-121053 Path of Equal Weight
- 04-12windows无法停止 服务 错误1053 服务没有及时响应
- 04-12Codeforces 1053 B - Vasya and Good Sequences
- 04-121053 Path of Equal Weight (30 分)
- 04-121053 Path of Equal Weight (30 分)