样例3的输出应该是6吧

#include<bits/stdc++.h>
#define maxn 1000
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int s[maxn], b[maxn];
int main(){
    fast;
    int n, smax = 1, bmax = 0, minn;
    cin>>n;
    for(int i = 1; i <= n; i++){
        cin>>s[i]>>b[i];
        smax *= s[i];
        bmax += b[i];
    }
    if(abs(smax - bmax) > abs(bmax - smax)) minn = abs(bmax - smax);
    else minn = abs(smax - bmax);
    cout<<minn;
    return 0;
}
算法复杂度：O(n)
10分求助！