1.思路 

1.先计算包含天降神兵的势力

#include <iostream>
using namespace std;
int main(){
    long long n;
	cin >> n;
	long long c[n+10];
	for (long long i= 1; i <= n; i++){
		cin >> c[i];
	} 
	long long m,p1,s1,s2;
	cin >> m >> p1 >> s1 >> s2;
	long long sl_1 = 0;
	long long sl_2 = 0;
	c[p1] += s1;
	for (long long i= 1; i <= n; i++){
		if (i < m){
			sl_1 +=