C++14 解法, 执行用时: 2ms, 内存消耗: 376KB, 提交时间: 2020-05-18

#include <stdio.h>
     
int main()
{
    int n, x, smaller = 0, equal = 0, bigger = 0, i, m;
    scanf("%d%d", &n, &x);
    m = (n - 1) >> 1;
    for (i = 0; i < n; ++i)
    {
        int cur;
        scanf("%d", &cur);
        if (cur == x)
        {
            equal++;
        }
        else if (cur < x)
        {
            smaller++;
        }
        else
        {
            bigger++;
        }
    }
    if (smaller <= m)
    {
        if (bigger < n - m)
        {
            puts("0");
        }
        else
        {
            printf("%d\n", bigger - smaller - equal);
        }
    }
    else
    {
        printf("%d\n", smaller + 1 - equal - bigger);
    }
    return 0;
}

C++14 解法, 执行用时: 2ms, 内存消耗: 392KB, 提交时间: 2020-07-16

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,lcount=0,scount=0,ecount=0,max=0,num;
    long long int x;
    cin>>n>>x;
    long long int a[1000];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        if(a[i]>x)
            lcount++;
        else if(a[i]<x)
            scount++;
        else
        {
            ecount++;
            if(i>max)
            max=i;
        }
    }

        if(lcount>scount)
        {
            if((num=lcount-scount-ecount)>0)
                num=lcount-scount-ecount;
            else num=0;
        }
        if(lcount==scount)
            num=1-(ecount>0);
        if(lcount<scount)
        {
            if((scount+1-lcount-ecount)>0)
            num=scount+1-lcount-ecount;
            else num=0;
        }
    cout<<num;
    return 0;
}

C++ 解法, 执行用时: 2ms, 内存消耗: 400KB, 提交时间: 2020-08-06

#include "bits/stdc++.h"
using namespace std;
const int maxn=1e5+100;
int n,m,a[maxn];
int main()
{
    //scanf("%d%d",&n,&m);
    cin>>n>>m;
    int small=0,big=0,equal=0;
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
        if(a[i]<m) small++;
        else if(a[i]>m) big++;
        else equal++;
    }
    if(small<big) printf("%d\n",max(big-small-equal,0));
    else if(small>big) printf("%d\n",max(small-big-equal+1,0));
    else{
        if(equal==0) printf("1\n");
        else printf("0\n");
    }
    return 0;
}

C 解法, 执行用时: 2ms, 内存消耗: 472KB, 提交时间: 2020-05-03

#include <stdio.h>
  
int main()
{
    int n, x, smaller = 0, equal = 0, bigger = 0, i, m;
    scanf("%d%d", &n, &x);
    m = (n - 1) >> 1;
    for (i = 0; i < n; ++i)
    {
        int cur;
        scanf("%d", &cur);
        if (cur == x)
        {
            equal++;
        }
        else if (cur < x)
        {
            smaller++;
        }
        else
        {
            bigger++;
        }
    }
    if (smaller <= m)
    {
        if (bigger < n - m)
        {
            puts("0");
        }
        else
        {
            printf("%d\n", bigger - smaller - equal);
        }
    }
    else
    {
        printf("%d\n", smaller + 1 - equal - bigger);
    }
    return 0;
}

C++14 解法, 执行用时: 2ms, 内存消耗: 484KB, 提交时间: 2020-05-11

#include <stdio.h>
    
int main()
{
    int n, x, smaller = 0, equal = 0, bigger = 0, i, m;
    scanf("%d%d", &n, &x);
    m = (n - 1) >> 1;
    for (i = 0; i < n; ++i)
    {
        int cur;
        scanf("%d", &cur);
        if (cur == x)
        {
            equal++;
        }
        else if (cur < x)
        {
            smaller++;
        }
        else
        {
            bigger++;
        }
    }
    if (smaller <= m)
    {
        if (bigger < n - m)
        {
            puts("0");
        }
        else
        {
            printf("%d\n", bigger - smaller - equal);
        }
    }
    else
    {
        printf("%d\n", smaller + 1 - equal - bigger);
    }
    return 0;
}