@[苏联小渣](/user/399286) @[Ginger_he](/user/379058)
by InversionShadow @ 2023-01-30 17:20:49
@ 管理员啊
by yszkddzyh @ 2023-01-30 17:23:14
@[chen_zhe](/user/8457) @[小粉兔](/user/10703)
by InversionShadow @ 2023-01-30 17:23:48
...水题解
by Einstein_bili @ 2023-01-30 17:26:04
@[feecle6418](/user/42156)
by yszkddzyh @ 2023-01-30 17:26:29
~~新管理办事快~~
by yszkddzyh @ 2023-01-30 17:26:48
@[yuandingquan1101](/user/672281) 我的问题，我现在改
by Ginger_he @ 2023-01-30 17:56:50
```cpp
#include<bits/stdc++.h>
using namespace std;
#define N 1005
int n,t,x,y,a[N],b[N],ans;
char c;
int main()
{
scanf("%d",&n);
b[++y]=-1;
for(int i=1;i<=n;i++)
{
scanf("\n%c%d",&c,&t);
if(c=='L') a[++x]=t;
else b[++y]=t;
}
sort(a+1,a+x+1);
sort(b+1,b+y+1);
a[++x]=1e9+1,ans=n-1;
for(int i=1;i<=x;i++)
{
for(int j=1;j<=y;j++)
{
if(a[i]>=b[j]) ans=min(ans,i-1+y-j);
else break;
}
}
printf("%d\n",ans);
return 0;
}
by Ginger_he @ 2023-01-30 18:04:40
@[yuandingquan1101](/user/672281) 已添加数据，感谢您的反馈。相关题解看起来已经修了 bug 了，如果有其他题解有问题可以让我撤下
by 小粉兔 @ 2023-01-31 20:20:45