20pts 求条qwq

#include<bits/stdc++.h>
using namespace std;
const int N=20;
struct food{
	int s,b;
};
int n,ans=1e9;
food a[N];
bool vis[N];
void dfs(int k)
{
	if(k>n)
	{
		int sum_s=1,sum_b=0;
		for(int i=1;i<=n;i++)
		{
			if(vis[i])
			{
				sum_s*=a[i].s;
				sum_b+=a[i].b;
			}
//			cout<<vis[i]<<" ";
		}
		if(sum_s!=0||sum_b!=0) ans=min(ans,abs(sum_s-sum_b));
//		cout<<endl<<ans<<" "<<sum_s<<" "<<sum_b<<endl;
		return;
	}
	vis[k]=1;
	dfs(k+1);
	vis[k]=0;
	dfs(k+1);
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].s>>a[i].b;
	}
	dfs(1);
	cout<<ans;
	return 0;
}