func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 155;   int f[maxn][maxn * maxn], a[maxn];   int n, K, s, ans = 2e9, cur;   void solve() {     sort(a + 1, a + n + 1);     ans = 0;     for (int i = 1; i <= K; i++) ans += a[i];     printf( %d n , ans);   }   int main() {     scanf( %d%d%d , &n, &K, &s);     for (int i = 1; i <= n; i++) scanf( %d , &a[i]);     if (s >= n * (n - 1) / 2) {       solve();       return 0;     }     memset(f, 0x3f, sizeof f);     f[0][0] = 0;     for (int j = 1; j <= n; j++)       for (int i = K - 1; i >= 0; i--)         for (int k = 0; k <= min(s, n * i); k++)           f[i + 1][k + j - (i + 1)] =               min(f[i + 1][k + j - (i + 1)], f[i][k] + a[j]);     for (int i = 0; i <= s; i++) ans = min(ans, f[K][i]);     printf( %d n , ans);     return 0;   }   