龙虎斗C++

#include<bits/stdc++.h>
using namespace std;
const int Mx = 100000 + 10;
long long int n, m, p1, s1, s2, res;
long long int t1, temp, t2;
long long int a[Mx];
int main()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	cin >> m >> p1 >> s1 >> s2;
	a[p1] += s1;
	for(int i = 1; i <= n; i++)
	{
			t1 += (m - i) * a[i];
	}
	temp = abs(t1);
	res = m;
	for(int i = 1; i <= n; i++)
	{
		long long int x = t1 + (m - i) * s2;
		if(abs(x) < abs(temp))
		{
			temp = x;
			res = i;
		}
	}
	cout << res;
	return 0;
}