急死我了机试之基贪心算法【暂未通过】

救命，根本不会，写了三小时，输出还是错。留着下辈子做。。。。
牛客原题链接

#include <stdio.h>

#define Nmax 500

// 结构体数组，有点像成绩排序那题,对distance进行主要排序，oilPrice次要排序

typedef struct{
    float oilPrice;
    int distance;

}Station;

// 按照路程的近到远排序
void BubbleSort(Station station[],int N){
    int i,j;
    Station tmp;
    for(i=0;i<N;i++){
        for(j=1;j<=N-1-i;j++){
            if(station[j-1].distance>=station[j].distance){
                tmp=station[j-1];
                station[j-1]=station[j];
                station[j]=tmp;
                if(station[j-1].distance==station[j].distance&&station[j-1].oilPrice>station[j].oilPrice){
                    tmp=station[j-1];
                    station[j-1]=station[j];
                    station[j]=tmp;
                }
            }
        }
    }
}

//1. stations[0].distance=0,return 0
//2. 可以到达，return 1
// question：怎么判断可以达到啊？ totalDistance += totalAddOil/Davg == D?
//一个for循环，每次都判断这个加油站要不要加油
//2.1 这站油费便宜，直接加满
//2.2 下一站的油费便宜，加到到下一站距离的 needAddOil ==stations[i].distance-stations[i-1].distance=nowOil/Davg

//3. 不能到达，return 0
//4.是最后一个站点了

void Travel(Station station[],int N,int Cmax,int Davg,int D){
    int result;
    int i,j;
    float totalPrice,price,totalDis,needAddOil,totalAddOil,leftOil,betweenDis,leftDis,fullDis,tmpDis;
    
    //test part
    
    for(i=0;i<N;i++){
    	printf("%f,%d\n",station[i].oilPrice,station[i].distance);
	}
	printf("\n");

    //case1
    if(station[0].distance!=0){
        result= 0;
    }

    //case2、3
    else{
        totalAddOil=0;
        for(i=1;i<=N;i++){
            //每站判断要不要加满
            //如果相邻两站都一样价格怎么办啊？好像不影响，等号直接给
            
            //** 测试发现是betweenDis错误
            //N那一站点形成了负数，修改for中i 从1开始 i与i-1比较
            //除号与整除

                //case 4 [7]到终点
		    if(i==N){
		    	//加满是否能到
		    	printf("case 4\n");
		    	leftDis=D-station[i-1].distance;

		    	needAddOil=leftDis/Davg;
		    	printf("need:%f\n",needAddOil);

				//到不了
		       	if(needAddOil>Cmax){
		       		printf("cant \n");
		       		result=0;
		       		totalAddOil+=Cmax;

		       		//算钱；
		       	    price=Cmax*station[i-1].oilPrice;
		            totalPrice+=price;

		            printf("4.1 time：%d,leftDis:%f,needAddOil0:%f,totalAddOil0:%f,price:%f,totalPrice:%f,result:%d\n",i-1,leftDis,Cmax,totalAddOil,price,totalPrice,result);
		            break;

				   }
				else{
					printf("can\n");
					result=1;
					totalAddOil+=needAddOil;

					//算钱；
		       	    price=needAddOil*station[i-1].oilPrice;
		            totalPrice+=price;
		            printf("4.2 time：%d,leftDis:%f,needAddOil0:%f,totalAddOil0:%f,price:%f,totalPrice:%f,result:%d\n",i-1,leftDis,needAddOil,totalAddOil,price,totalPrice,result);
		            break;



				}

			}

            //2.1 加满

            //***错误：加满要考虑加满站的下一站与下下一站，决定在下一站加多少，leftOil
            // [i+2]-[i]=cmax*Davg+leftOil*Davg
            // 所以i多算了一站，直接i++
            //搞个循环，i++，看到哪个站加满的油会用完
            else if(station[i-1].oilPrice<=station[i].oilPrice){
            	printf("jin ru 2.1\n");
            	
            	//Cmax 格式错
                needAddOil=Cmax*1.0;
                totalAddOil+=needAddOil;
                
                fullDis=Cmax*1.0*Davg;
                
                for(j=i;j<N;j++){
                	betweenDis=station[j].distance-station[i-1].distance;
                	if(betweenDis>fullDis){
                		betweenDis=station[j-1].distance-station[i-1].distance;
                		break;
					}
				}
				
				 //test
                printf("2.1 time：%d,needAddOil:%f,totalAddOil:%f,betweenDis:%f,leftOil:%f,fullDis:%f\n",i-1,needAddOil,totalAddOil,betweenDis,leftOil,fullDis);
                //算钱1
                price=Cmax*station[i-1].oilPrice;
                totalPrice+=price;
                
                leftDis=fullDis-betweenDis;
                //跳过站点,跳过j因为已经可以算出了，要直接j+1-j加够油
                i=j;

                leftOil=Cmax-betweenDis/Davg;
                
		

                 //test
                printf("time:%d,price:%f,totalPrice:%f\n",i-1,price,totalPrice);
				//算钱j
				betweenDis=station[j].distance-station[j-1].distance-leftDis;
				needAddOil=betweenDis/Davg;
				totalAddOil+=needAddOil;
				
				price=needAddOil*station[j-1].oilPrice;
                totalPrice+=price;
                
                printf("j time：%d,j:%d,jmoney:%f,needAddOil:%f,totalAddOil:%f,betweenDis:%f,leftOil:%f,fullDis:%f\n",i-1,j,station[j-1].oilPrice,needAddOil,totalAddOil,betweenDis,leftOil,fullDis);
				
				
                // 这边要加一个跳出循环
                if(leftOil>Cmax){
                	result=0;
                	break;
				}

                //test
                printf("time:%d,price:%f,totalPrice:%f\n",i-1,price,totalPrice);
            }
            //2.2 加到下一站的油
            //这边150/12 向下取整了啊
            
            else{
            
                betweenDis=station[i].distance-station[i-1].distance;
                printf("i:%d,下一站：%d,本站:%d,间距：%f,Davg:%d\n",i,station[i].distance,station[i-1].distance,betweenDis,Davg);
                needAddOil=betweenDis/Davg;
                totalAddOil+=needAddOil;
                  //test
                printf("2.2 time：%d,needAddOil0:%f,totalAddOil0:%f,betweenDis:%f\n",i-1,needAddOil,totalAddOil,betweenDis);
                //算钱
                price=needAddOil*station[i-1].oilPrice;
                totalPrice+=price;
                //test
                printf("time:%d,price:%f,totalPrice:%f\n",i-1,price,totalPrice);
            }

        }
        // for 出来totalAddOil来判断能不能到达终点
        totalDis=totalAddOil*Davg;
        if(totalDis>=D){
            result=1;
        }
        else {
        
            result=0;

        }

    }

    //对result进行判断，输出结果了

   if(result==1){

    printf("hhhh:%f",totalPrice);
   }
   else{
    printf("The maximum travel distance = %7.2f\n",totalDis);
    printf("totalAddOil:%f ",totalAddOil);
   }

}

int main() {
   int Cmax,D,Davg,N,i,result,totalPrice,maxDistance;
   Station stations[Nmax];

   scanf("%d %d %d %d",&Cmax,&D,&Davg,&N);

   //init station
   for(i=0;i<N;i++){
    scanf("%f %d",&stations[i].oilPrice,&stations[i].distance);
   }

   // distance 按照从近到远
   BubbleSort(stations,N);

   // 贪心 下一站的邮费比当前贵？加满：不加满
   // tank is empty,故无distance==0，直接pass

   // return 0/1

   Travel(stations,N,Cmax,Davg,D);



}