WA了第21个和第24个点

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long n,m,p1,s1,s2, dra=0,tig=0, boom[100100],ewn[100100],d[100100],t[100100], p2=1;
struct army{
	long long c,w,co;
}a[20000000];
int main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
		scanf("%lld",&a[i].c);
	scanf("%lld%lld%lld%lld",&m,&p1,&s1,&s2);
	for(int i=1;i<=n;i++){
		a[i].co=labs(m-i)*a[i].c;
		(i<=m) ?(dra+=a[i].co) :(tig+=a[i].co);
	}
	(p1<=m)?dra+=s1*(m-p1):tig+=s1*(p1-m);
	for(int i=1;i<=n;i++){
		boom[i]=s2*labs(m-i);
		(i<=m) ?(ewn[i]=labs(dra+s2*(m-i)-tig)) :(ewn[i]=labs(tig+s2*(i-m)-dra));
	} 
	int yon=ewn[1];
	for(int i=1;i<=n;i++)
		if(ewn[i]<yon) p2=i,yon=ewn[i];
	cout<<p2;
	return 0;
}

感谢大佬qwq