思路
code
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 3e5;
const ll mod = 998244353;
ll n, m, a[N];
int main ()
{
cin >> n;
for(ll i = 1; i <= n; i++)
cin >> a[i];
sort(a+1, a+n+1);
ll ans = 0, temp = 0;
for(ll i = 1; i <= n; i++)
{
ans = (ans + a[i]*a[i]) % mod;
ans = (ans + a[i] * temp) % mod;
temp = (2 * temp + a[i]) % mod;
}
cout << ans%mod << endl;
return 0;
}