洛谷 P2338 [USACO14JAN]失败的滑雪Bessie Slows Down

P2338 [USACO14JAN]失败的滑雪Bessie Slows Down

模拟

#include<bits/stdc++.h>
using namespace std;
int n,m,v;
int num1,num2,now1,now2;
double t[100000],d[100000],nows,nowt;
char a;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        cin>>a>>m;
        if(a=='T')    t[++num1]=m;
        else d[++num2]=m;
    }
    sort(d+1,d+num2+1);
    sort(t+1,t+num1+1);
    v=1; now1=1; now2=1;
    for(int i=1;i<=n;i++)
    {
        if((now2>num2||(d[now2]-nows)*v+nowt>=t[now1])&&(now1<=num1))
        {
            if((t[now1]-nowt)/v+nows>1000) break;
            nows+=(t[now1]-nowt)/v; nowt=t[now1]; v++; now1++;
        }
        else
        {
            if(d[now2]>1000) break;
            nowt+=(d[now2]-nows)*v; nows=d[now2]; v++; now2++;
        }
    }
    cout<<int((1000-nows)*v+nowt+0.499999);
    return 0;
}