\u4ee3\u7801<\/h2>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\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);\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, int> pii;\ntypedef unsigned long long ull;\n\nconst int INF = 0x3f3f3f3f, mod = 1000000007;\nconst int N = 2e5 + 10;\n\nvoid solve()\n{\n int n;\n cin >> n;\n vector<int> a(n), b(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n for (int i = 0; i < n; i++) {\n cin >> b[i];\n }\n\n ll sum = 0;\n vector<array<int, 3>> seg(n);\n for (int i = 0; i < n; i++) {\n sum += abs(a[i] - b[i]);\n if (a[i] < b[i])\n seg[i] = { a[i], b[i], 0 };\n else\n seg[i] = { b[i], a[i], 1 };\n }\n sort(seg.begin(), seg.end());\/\/\u6309\u7167\u5de6\u7aef\u70b9\u6392\u5e8f\n int mx[2] = { (int)-2e9, (int)-2e9 };\n ll ans = sum;\n for(auto [l, r, f] : seg){\n auto mxx = mx[f ^ 1];\/\/\u7531\u4e4b\u524d\u7684\u63a8\u8bba\u53ef\u5f97\u5339\u914d\u4e0d\u540c\u7c7b\u578b\u7684\u624d\u80fd\u4f7f\u5f97\u548c\u8d8a\u5c0f\n if(mxx > l)\n ans = min(ans, sum - 2ll * (min(r, mxx) - l));\n \/\/\u5f53\u524d\u7ebf\u6bb5\u7684\u5de6\u7aef\u70b9\u4e00\u5b9a\u8981\u5c0f\u4e8e\u4e0b\u4e00\u4e2a\u7ebf\u6bb5\u7684\u5de6\u7aef\u70b9\uff0c\u4e00\u5b9a\u662f\u80fd\u5305\u88f9\u4e0b\u4e00\u4e2a\u7ebf\u6bb5\u7684\u5de6\u7aef\u70b9\u7684\uff0c\n \/\/\u7136\u540e\u6700\u957f\u516c\u5171\u5c31\u53d6\u51b3\u4e8e\u5f53\u524d\u7ebf\u6bb5\u7684\u53f3\u7aef\u70b9\u8fd8\u662f\u5df2\u7ecf\u5339\u914d\u8fc7\u7ebf\u6bb5\u7684\u6700\u957f\u53f3\u7aef\u70b9\u7684\u5dee\u503c\n mx[f] = max(r, mx[f]);\n }\n cout << ans << endl;\n\n}\nint main()\n{\n \/\/ IOS;\n int _ = 1;\n \/\/ cin >> _;\n while (_--) {\n solve();\n }\n return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u9898\u76ee\u94fe\u63a5 \u94fe\u63a5 \u9898\u76ee\u5927\u610f \u7ed9\u5b9a\u4e24\u4e2a\u5e8f\u5217ai,bi,\u73b0\u5728\u53ef\u4ee5\u9009\u62e9\u5176\u4e2d\u4e00\u4e2a\u5e8f\u5217\u4ea4\u6362\u5176\u4e2d\u7684\u4e24\u4e2a\u6570\u5b57\uff0c\u95ee\u7ecf\u8fc7\u81f3\u591a\u4e00\u6b21\u64cd\u4f5c\u540e\u6700\u5c0f\u7684|ai - bi|\u7684\u603b\u548c\u662f\u591a\u5c11\uff1f \u9898\u89e3 \u53c2\u8003\u4e86\u8fd9\u7bc7\u9898\u89e3\uff0c\u53ef\u4ee5\u5f97\u51fa\u6211\u4eec\u8981\u60f3\u628a\u4ed6\u51cf\u5c0f\uff0c\u90a3\u6211\u4eec\u5fc5\u987b\u4ea4\u6362\u4e24\u79cd\u4e0d\u540c\u5f62\u5f0f\u7684\u5e8f\u5217\uff0c\u7136\u540e\u95ee\u9898\u5c31\u8f6c\u6362\u6210\u4e3a\u6c42\u82e5\u5e72\u5e8f\u5217\u4e2d\u6700\u957f\u516c\u5171\u5e8f\u5217\u957f\u5ea6\u7684\u95ee\u9898 \u4ee3\u7801 #include <algorithm> #include <array> #include <bitset> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <fstream> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <unordered_map> #include <unordered_set> #include <vector> #define x first #define y second #define endl '\\n' #define IOS \\ ios_base::sync_with_stdio(0); \\ […]<\/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":[5,7],"class_list":["post-256","post","type-post","status-publish","format-standard","hentry","category-solution","tag-5","tag-7"],"_links":{"self":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/256","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=256"}],"version-history":[{"count":0,"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/256\/revisions"}],"wp:attachment":[{"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=256"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=256"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=256"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}