求问时间复杂度

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
const int MAXN = 1e5 + 5;
ll a[MAXN];
ll in[MAXN];
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    in[1] = a[1];
    for (int i = 2; i <= n; i++)
    {
        in[i] = in[i - 1] + a[i];
    }
    for (int k = 3; k <= n; k++)
    {
        for (int j = 0; j <= n - k; j++)
        {
            if (a[k + j] < in[j + k - 1] - in[j])
            {
                cout << k << " ";
                break;
            }
        }
    }
    return 0;
}