func_code_string: #include <bits/stdc++.h>   using namespace std;   const int INF = (int)1e9;   const int N = 155;   int old[N][N * N];   int now[N][N * N];   int q[N];   int main() {     ios_base::sync_with_stdio(0);     cin.tie(nullptr);     int n, k, s;     cin >> n >> k >> s;     for (int i = 0; i < n; i++) cin >> q[i];     for (int i = 0; i < N; i++)       for (int j = 0; j < N * N / 2; j++) old[i][j] = INF;     old[0][0] = 0;     for (int pos = 0; pos < n; pos++) {       for (int i = 0; i < N; i++)         for (int j = 0; j < N * N / 2; j++) now[i][j] = INF;       for (int taken = 0; taken <= k; taken++) {         for (int swaps = 0; swaps <= N * N / 2; swaps++) {           now[taken][swaps] = min(now[taken][swaps], old[taken][swaps]);           if (taken <= pos)             now[taken + 1][swaps + pos - taken] = min(                 now[taken + 1][swaps + pos - taken], old[taken][swaps] + q[pos]);         }       }       for (int i = 0; i < N; i++)         for (int j = 0; j < N * N / 2; j++) old[i][j] = now[i][j];     }     int res = INF;     for (int swaps = 0; swaps <= min(N * N / 2 - 1, s); swaps++)       res = min(res, now[k][swaps]);     cout << res << endl;     return 0;   }   