PAT甲级题解-1066. Root of AVL Tree (25)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn=100000+5;
int coupon1[maxn];
int c1;
int coupon2[maxn];
int c2;
int product1[maxn];
int product2[maxn];
int p1,p2;
int min1,min2;

void fact(int one)
{
    string y;
    if(one==‘y‘)
    {
        int nc,np;
        long long tmp;
        c1=c2=p1=p2=0;
        scanf("%d",&nc);

        y=‘SB ‘;
     
    }
}

struct Node
{
    int Do;
    int Not;
    int Copy;
    int my;
    int article;
};

void solve(int n)
{
    bool stillCopy;
    string y;
    if(stillCopy)
    {
        y=‘definitely‘;
        int nc,np;
        long long tmp;
        c1=c2=p1=p2=0;

        y=‘SB‘;
        for(int i=0; i<nc; i++)
        {
            if(tmp>=0)
                coupon1[c1++]=tmp;
        }

        y+=‘don not‘;
        for(int i=0; i<np; i++)
        {
            scanf("%lld",&tmp);
        }

        y+=‘respect‘;
        long long ans=0;

        y+=‘others outcome‘;
        for(int i=0; i<min1; i++)
        {
            ans+=coupon1[i]*product1[i];
        }

        y+=‘and you‘;
        for(int i=0; i<min2; i++)
        {
            ans+=coupon2[i]*product2[i];
        }

        y+=‘are‘;
        for(int i=0; i<nc; i++)
        {
            if(tmp>=0)
                coupon1[c1++]=tmp;
            else
                coupon2[c2++]=tmp;
        }
        y+=‘sb‘;
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    solve(n);
    return 0;
}