Submission #57263535

---

Source Code Expand

// LUOGU_RID: 175473768
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace std;
// using namespace  __gnu_pbds;
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> tr;//从小到大
// int findnum(int k){auto it=tr.find_by_order(k-1);return ((it!=tr.end())?(*it):1e9+7);}//查元素
// int findrank(int x){return tr.order_of_key(x)+1;}//查排名
// static char buf[100000],*pa=buf,*pd=buf;
// #define gc pa==pd&&(pd=(pa=buf)+fread(buf,1,100000,stdin),pa==pd)?EOF:*pa++ 
inline int read()
{
	int w = 1, s = 0; char ch = getchar();
	while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
	while(isdigit(ch)){s=s*10+(ch-'0');ch=getchar();}
	return w*s;
}
const int mod=998244353;
const int maxn=5e5+10;
const int inf=1e9+7;
int n,a[maxn];
int qw(int x,int y)
{
	int res=1;
	while(y)
	{
		if(y&1)res=res*x%mod;
        x=x*x%mod;
        y>>=1;
	}
	return res;
}
signed main()
{
#ifdef Lydic
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#endif
    cin>>n;
	for(int i=1;i<=n;i++)
	{
		a[i]=read();
	}
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	int ans=0,sum=0;
	for(int i=1;i<=n;i++)
	{
		ans=(ans+a[i]*a[i]%mod+a[i]*sum%mod)%mod;
		sum=(sum*2%mod+a[i])%mod;
	}
	cout<<ans;
    return 0;
}

Submission Info

Judge Result