80pts TLE 求优化

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353; 
signed main() {
    int n;
    cin>>n;
    vector<int>a(n);
    int sum=0;
    for (int i=0;i<n;i++) cin>>a[i],sum+=a[i];
    sort(a.begin(),a.end());
    vector<int> dp(sum+1,0);
    dp[0]=1;
    int ans=0;
    for (int i=0;i<n;i++){
        int x=a[i];
        for (int s=sum;s>=x;s--) {
            if (x*2<s) ans=(ans+dp[s-x])%mod;
            dp[s]=(dp[s]+dp[s-x])%mod;
        }
    }
    cout<<ans;
    return 0;
}