P134SUMG

#include<bits/stdc++.h>
using namespace std;

struct giavi
{
    int x,y;
};

void next(int a[],int n)
{
    int vt=n;
    while(a[vt]==1 && vt>=0) vt--;
    a[vt]=1;
    for(int i=vt+1;i<=n;i++) a[i]=0;
}

int main()
{
    int n;
    giavi s[15];
    int a[15];
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>s[i].x>>s[i].y;
        a[i]=0;
    }
    int mu=pow(2,n);
    int kq=99999;
    for(int i=1;i<mu;i++)
    {
        int ans1=0,ans2=1;
        next(a,n);
        for(int i=1;i<=n;i++)
        {
            if(a[i]==1)
            {
                ans2*=s[i].x;
                ans1+=s[i].y;
            }
        }
        int tg = abs(ans1-ans2);
        if(tg<kq) kq=tg;
    }
    cout<<kq;
}