天梯赛-L1-056 猜数字 (20 分)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
struct nm
{
    string name;
    int s;
} b[10001];

int cmp(nm a, nm b)
{
    return a.s < b.s;
}
int main()
{
    cin >> n;
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> b[i].name;
        cin >> b[i].s;
        sum += b[i].s;
    }
    int a = sum / (n * 2);
    if(n==1)
    {
        cout << b[0].s/2 << " "<<b[0].name;
        return 0;
    }
    cout << a << " ";
    sort(b, b + n, cmp);
    int l = 0;
    int r = n - 1;
    int mid;
    while (l <= r)
    {
         mid = (l + r) / 2;
        if (b[mid].s > a)
            r = mid - 1;
        else
            l = mid + 1;
    }
    if(b[mid].s==a)
    {
        cout << b[mid].name;
        return 0;
    }
    double c, v;
    c = b[l].s - a;
    c = abs(c);
    v = b[r].s - a;
    v = abs(v);
    if (c < v)
    {
        cout << b[l].name;
    }
    else
        cout << b[r].name;

    return 0;
}