求调，玄关

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct cw
{
	bool f;
	int w;
	bool operator <(const cw &B) const
	{
		return w<B.w;
	}
};
const int NR=50001;
cw c[NR];
int main()
{
	int n,a,b,i,ans=0;
	cin>>n>>a>>b;
	for(i=1;i<=n;i++)
	{
		string s;
		cin>>s>>c[i].w;
		if(s=="S") c[i].f=true;
		else c[i].f=false;
	}
	sort(c+1,c+n+1);
	if(c[1].w>a && c[1].f) ans=c[1].w-a;
	for(i=1;i<n && c[i+1].w<=b;i++)
	{
		if(c[i+1].w<=a) continue;
		if(c[i].f==c[i+1].f) ans+=(c[i+1].w-max(a,c[i].w))*c[i].f;
		else
		{
			int mid=(c[i].w+c[i+1].w)/2;
			if((c[i].w+c[i+1].w)%2) ans+=(mid-max(a,c[i].w)+1)*c[i].f+(c[i+1].w-1-mid)*c[i+1].f;
			else ans+=(mid-max(a,c[i].w))*c[i].f+1+(c[i+1].w-1-mid)*c[i+1].f;
		}
	}
	if(i<n)
	{
		if(c[i+1].f==c[i].f) ans+=(b-c[i].w+1)*c[i].f;
		else
		{
			int mid=(c[i].w+c[i+1].w)/2;
			if(mid>b) ans+=(b-c[i].w+1)*c[i].f;
			else ans+=(mid-c[i].w)*c[i].f+1+(b-mid)*c[i+1].f;
		}
	}
	else ans+=(b-c[i].w+1)*c[i].f;
	cout<<ans;
	return 0;
}