贝茜放慢脚步----二路归并

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10010;
int a[N],b[N];
int idx1,idx2;
int main()
{
    int n,x;
    cin>>n;
    char op[2];
    for(int i=0;i<n;i++)
    {
        cin>>op>>x;
        if(op[0]=='T')a[idx1++]=x;
        else b[idx2++]=x;
    }
    sort(a,a+idx1);
    sort(b,b+idx2);
    int i=0,j=0,v=1;
    double dis=0,t=0;
    while(i<idx1&&j<idx2)
    {
        double t1=a[i]-t;
        double t2=(b[j]-dis)*v;
        if(t1==t2)
        {
            t=a[i];
            dis=b[j];
            v+=2;
            i++,j++;
        }
        else if(t1<t2)
        {
            dis+=(a[i]-t)/v;
            t=a[i];
            i++,v++;
        }
        else
        {
            t+=(b[j]-dis)*v;
            dis=b[j];
            v++,j++;
        }
        
    }
    while(i<idx1)
    {
        dis+=(a[i]-t)/v;
        t=a[i];
        i++,v++;
    }
    while(j<idx2)
    {
        t+=(b[j]-dis)*v;
        dis=b[j];
        v++,j++;
    }
    cout<< (int)(t+(1000-dis)*v+0.5000001) <<endl;
}