CCF2019-09第一题C++

#include<iostream>
using namespace std;

int main(){
	int tree_num,turn;
	cout<<"苹果树和操作的轮数"<<endl;
	cin>>tree_num>>turn;
	int i,j;
	int apple_num,apple_sum=0;    
	int flag,min_cutsum=0,cut_sum=0;
	int cut_num;
	for(i=1;i<=tree_num;i++){                   //先输入每一棵树的苹果的总数
		cout<<"第"<<i<<"棵苹果树的总数"<<endl; 
		cin>>apple_num;
		apple_sum=apple_sum+apple_num; 
		for(j=1;j<=turn;j++){                 //每一棵树进行的多轮的操作
			cout<<"第"<<j<<"轮操作"<<endl; 
			cin>>cut_num;
			apple_sum=apple_sum+cut_num;     
			cut_sum=cut_sum+cut_num;
		}
		if (cut_sum<min_cutsum){           //找出疏果最多的并记录是哪一棵
			min_cutsum=cut_sum;
			flag=i;
     	}
     	cut_sum=0;
	}
	min_cutsum=-min_cutsum;
	cout<<apple_sum<<flag<<min_cutsum;
}