PAT乙级 在霍格沃茨找零钱（c++）

✨输入的时候 第一个数字是商品得价格，第二个数字是拥有的钱
✨当钱小于商品得价格时，就需要用大的数字减小的数字

#include<string>
#include<stdio.h>
#include<vector>
using namespace std;

vector<string> split(const string &s,const string & dim){
    vector<string> vec;
    if(s == "") return vec;
    char *c = new char[s.length()+1];
    strcpy(c,s.c_str());

    char *d = new char[dim.length()+1];
    strcpy(d,dim.c_str());

    char *p = strtok(c,d);
    while(p){
        string s1 = p;
        vec.push_back(s1);
        p = strtok(NULL, d);
    }
    return vec;


}

void result1(long g1,int s1,int k1,long g2,int s2,int k2,int flag){
	int g,sz,k;
	g=sz=k=0;
	if(k2<k1){
		s2--;
		k2 = k2+29;
		k = k2-k1;
	}else{
		k = k2-k1;
	}

	if(s2<s1){
		g2--;
		s2 = s2+17;
		sz = s2-s1;
	}else{
		sz = s2-s1;
	}

	g = g2-g1;
	if(flag==0){
		cout<<"-"<<g<<"."<<sz<<"."<<k;
	}else{
		cout<<g<<"."<<sz<<"."<<k;
	}

}

int main(){

	string s;
	string ss;
	cin>>s>>ss;
	char c ;

	long g1 = 0;
	long g2 = 0;


	vector<string> v1 = split(s,".");
	vector<string> v2 = split(ss,".");

	int x=0;
	while(x<v1[0].size()){
		g1 = g1*10 + v1[0][x]-'0';
		x++;
	}

	int j=0;
	while(j<v2[0].size()){
		g2 = g2*10 + v2[0][j]-'0';
		j++;
	}
	
	

	int s1 = v1[1].size()==2?(v1[1][0]-'0') *10 + v1[1][1]-'0' : v1[1][0]-'0';
	int s2 = v2[1].size()==2?(v2[1][0]-'0') *10 + v2[1][1]-'0' : v2[1][0]-'0';

	int k1 = v1[2].size()==2? (v1[2][0]-'0') *10 + v1[2][1]-'0' : v1[2][0]-'0';
	int k2 = v2[2].size()==2? (v2[2][0]-'0') *10 + v2[2][1]-'0' : v2[2][0]-'0';

	if(g1>g2){
		result1(g2,s2,k2,g1,s1,k1,0);
	}else{
		result1(g1,s1,k1,g2,s2,k2,1);
	}

	
	

}