\u9898\u76ee\u94fe\u63a5<\/a><\/p>\nsolution<\/h2>\n
\u901a\u8fc7\u62c6\u89e3\u516c\u5f0f\uff0c\u53ef\u4ee5\u5f97\u51fa\u5f53a[i] < x<\/code>\u65f6\u5019\uff0c\u8fdb\u884c\u516c\u5f0f\u53d8\u6362\u540e\u4e5f\u8fd8\u662f\u539f\u6765\u7684\u6570\u503c\uff0c\u6240\u4ee5\u6211\u4eec\u53ea\u7528\u5904\u7406\u5927\u4e8e\u7b49\u4e8e\u7684\u60c5\u51b5\u3002\u9996\u5148\u60f3\u5230\u7684\u65b9\u6cd5\u662f\u641c\u7d22\u3002<\/p>\n#include<map>\n#include<set>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<vector>\n#include<bitset>\n#include<cstdio>\n#include<cstring>\n#include<fstream>\n#include<cstdlib>\n#include<iostream>\n#include<algorithm>\n#include<unordered_map>\n\nusing namespace std;\n#define x first\n#define y second\n#define endl '\\n'\n#define IOS \\\n ios_base::sync_with_stdio(0); \\\n cin.tie(0); \\\n cout.tie(0);\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef unsigned long long ull;\nconst int INF = 0x3f3f3f3f, mod = 1000000007;\nconst int N = 2e5 + 10;\nll ans = 1e18, x, n, a[30];\nvector<int> v;\nvoid dfs(ll last, ll x)\n{\n if (last >= v.size() || (last < v.size() && x > v[v.size() - 1])) {\n ans = min(x, ans);\n return;\n }\n \n for (int i = last; i < v.size(); i++) {\n if (v[i] >= x) {\n dfs(i + 1, x + (v[i] \/ x) * (v[i] + v[i] % x));\n }\n }\n}\n\nvoid solve()\n{\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n }\n cin >> x;\n for (int i = 1; i <= n; i++) {\n if (a[i] >= x) {\n v.emplace_back(a[i]);\n }\n }\n sort(v.begin(), v.end());\n dfs(0, x);\n cout << ans << endl;\n}\nint main(){\n \/\/ IOS;\n int t = 1;\n \/\/ cin >> t;\n while(t--){\n solve();\n }\n return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u9898\u76ee\u94fe\u63a5 \u9898\u76ee\u94fe\u63a5 solution \u901a\u8fc7\u62c6\u89e3\u516c\u5f0f\uff0c\u53ef\u4ee5\u5f97\u51fa\u5f53a[i] < x\u65f6\u5019\uff0c\u8fdb\u884c\u516c\u5f0f\u53d8\u6362\u540e\u4e5f\u8fd8\u662f\u539f\u6765\u7684\u6570\u503c\uff0c\u6240\u4ee5\u6211\u4eec\u53ea\u7528\u5904\u7406\u5927\u4e8e\u7b49\u4e8e\u7684\u60c5\u51b5\u3002\u9996\u5148\u60f3\u5230\u7684\u65b9\u6cd5\u662f\u641c\u7d22\u3002 #include<map> #include<set> #include<stack> #include<queue> #include<cmath> #include<vector> #include<bitset> #include<cstdio> #include<cstring> #include<fstream> #include<cstdlib> #include<iostream> #include<algorithm> #include<unordered_map> using namespace std; #define x first #define y second #define endl '\\n' #define IOS \\ ios_base::sync_with_stdio(0); \\ cin.tie(0); \\ cout.tie(0); typedef long long ll; typedef pair<int,int> PII; typedef unsigned long long ull; const int INF […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[24],"class_list":["post-83","post","type-post","status-publish","format-standard","hentry","category-solution","tag-dfs"],"_links":{"self":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/83","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=83"}],"version-history":[{"count":0,"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/83\/revisions"}],"wp:attachment":[{"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=83"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=83"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=83"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![\"image.png\"](\"\/wp-content\/uploads\/2026\/11\/image-9.png\" "\\"image.png\\"")
<\/p>\n