JIAJIARUI大神来发题解了！！！ `#include <bits/stdc++.h> using namespace std;

int main() { int n; cin >> n;

const int INF = 1e9;
vector<int> dp(n + 1, INF);
dp[0] = 0;

int coins[3] = {1, 5, 11};

for (int i = 1; i <= n; i++) {
    for (int c : coins) {
        if (i >= c) {
            dp[i] = min(dp[i], dp[i - c] + 1);
        }
    }
}

cout << dp[n] << endl;
return 0;}

`