Problem p02615 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
// #define ll long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define IOS                                                                    \\
  std::ios::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define endl '\\n'
#define all(x) x.begin(), x.end()
#define f(i, j, l) for (i = j; i < l; i++)
#define smax(a, b) a = max(a, b)
// #if !defined(ONLINE_JUDGE)
// #include "debugging.h"
// #endif
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// erase,insert same as normal set

// int const mod = 7340033;
// int const mod = 998244353;
int const mod = 1e9 + 7;
int power(int a, int b, int m) {
  int res = 1;
  while (b) {
    if (b & 1) {
      res = res * a;
      res %= m;
    }
    a = a * a;
    a %= m;
    b = b / 2;
  }
  return res;
}

int inverse(int x, int m) { return power(x, m - 2, m); }

int const N = 5005;
int const inf = 2e16;

void solve() {
  int i, j, l;
  int n;
  cin >> n;
  int a[n];
  for (i = 0; i < n; i++)
    cin >> a[i];
  sort(a, a + n);
  int ans = a[n - 1];
  j = 2;
  i = n - 2;
  while (j < n) {
    ans = ans + a[i];
    j++;
    if (j < n)
      ans = ans + a[i];
    j++;
    i--;
  }
  cout << ans << endl;
}

int32_t main() {
  IOS;
  int t;
  t = 1;
  // precompute();
  // cin>>t;
  for (int tt = 1; tt <= t; tt++) {
    solve();
  }
  return 0;
}

/*




*/

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
// #define ll long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define IOS                                                                    \\
  std::ios::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define endl '\\n'
#define all(x) x.begin(), x.end()
#define f(i, j, l) for (i = j; i < l; i++)
#define smax(a, b) a = max(a, b)
// #if !defined(ONLINE_JUDGE)
// #include "debugging.h"
// #endif
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// erase,insert same as normal set

// int const mod = 7340033;
// int const mod = 998244353;
int const mod = 1e9 + 7;
int power(int a, int b, int m) {
  int res = 1;
  while (b) {
    if (b & 1) {
      res = res * a;
      res %= m;
    }
    a = a * a;
    a %= m;
    b = b / 2;
  }
  return res;
}

int inverse(int x, int m) { return power(x, m - 2, m); }

int const N = 5005;
int const inf = 2e16;

void solve() {
  int i, j, l;
  int n;
  cin >> n;
  int a[n];
  for (i = 0; i < n; i++)
    cin >> a[i];
  sort(a, a + n);
  int ans = a[n - 1];
  j = 2;
  i = n - 2;
  while (j < n) {
    ans = ans + a[i];
    j--;
    if (j)
      ans = ans + a[i];
    j--;
    i--;
  }
  cout << ans << endl;
}

int32_t main() {
  IOS;
  int t;
  t = 1;
  // precompute();
  // cin>>t;
  for (int tt = 1; tt <= t; tt++) {
    solve();
  }
  return 0;
}

/*




*/