陌陌的pat乙级题解目录
题解
有人说是水题 |
---|
哈哈哈哈也不尽然 |
如果一开始没仔细看题,像我一样。那可就不是水题了哈哈哈 |
Code
#include <iostream>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
for (int k = 0; k < N; k++)
{
int a, b, t = -2;
double sum = 0;
int mint = M + 1, maxt = -1;
cin >> a;
for (int i = 1; i < N; i++)
{
cin >> b;
if (0 <= b && b <= M)
{
maxt = max(b, maxt);
mint = min(b, mint);
sum += b;
t++;
}
}
sum = (sum - mint - maxt) / t;
cout << int((sum + a) / 2 + 0.5) << endl;
}
return 0;
}