显示代码纯文本
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=110;
ll n,a,b,ans;
map<ll,ll> m;
vector<ll> g;
int main()
{
freopen("Compatible.in","r",stdin);
freopen("Compatible.out","w",stdout);
cin>>n>>a>>b;
for(int i=1;i<=n;i++)
{
int u,v;
cin>>u>>v;
m[v]=u;
g.push_back(v);
}
sort(g.begin(),g.end());
for(int i=0;i<g.size();i++){
int x=g[i];
int pa=a-x,pb=b-x;
if(m[pb]>0&&pb>=0){
if(pb==x) ans+=m[pb]/2,m[pb]%=2;
else{
int minn=min(m[x],m[pb]);
ans+=minn;
m[x]-=minn;
m[pb]-=minn;
}
}
if(m[pa]>0&&pa>=0){
if(pa==x) ans+=m[pa]/2,m[pa]%=2;
else{
int minn=min(m[x],m[pa]);
ans+=minn;
m[x]-=minn;
m[pa]-=minn;
}
}
}
cout<<ans<<endl;
return 0;
}