uva 10107

#include <cstdio>
#include <iostream>
using namespace std;

long long Median, arr[10010];


int main()
{
    int i, cur_index, count, isOdd;
    count = 0;
    while(scanf("%lld", &arr[0]) != EOF)    // arr[0] is a monitor
    {
        count ++;    // count: caculate numbers
        cur_index = count;    // cur_index initial value: count
        for(i=1; i<count; i++)
        {
            if(arr[0] < arr[i])
            {
                cur_index = i;
                break;
            }
        }

        for(i=count; i>cur_index; i--)    // backword move to arr[count]
            arr[i] = arr[i-1];
        
        arr[cur_index] = arr[0];    // whatever, this is must.

        isOdd = count % 2;
        if(isOdd)
            Median = arr[count/2 + 1];    // odd
        else Median = (arr[count/2 +1] + arr[count/2]) / 2;    // even

        cout << Median << endl;
    }
    return 0;   
}

犯错：漏写 break; 语句

// 20160125
#include <cstdio>
#include <iostream>
using namespace std;

int main()
{
    int x, i, j, arr[10005], n = 0;
    while(scanf("%d", &x) != EOF)
    {
        j = n;
        for(i = 0; i < n; i++)
            if(x < arr[i])
            {
                j = i;
                break;
            }
        for(i=n; i > j; i--)
            arr[i] = arr[i-1];
        arr[j] = x;
        n ++;

        if(n % 2) cout << arr[n / 2] << endl;
        else {
            long median = 0;
            median = median + arr[n / 2 - 1] + arr[n / 2];
            cout << median / 2 << endl;
        }
    }
    return 0;
}