| Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|---|
| 38605 | penglangjie | 【J】T1 | C++ | 解答错误 | 56 | 63 MS | 1820 KB | 707 | 2025-10-18 13:31:48 |
#include <bits/stdc++.h> using namespace std; #define ll long long ll g_llX[1000005] = {0}; ll g_llY[1000005] = {0}; int main() { ll llN = 0; ll llC = 0; ll llSum1 = 0; ll llSum2 = 0; cin >> llN >> llC; for (ll i = 1; i <= llN; i++) { cin >> g_llX[i]; llSum1+=g_llX[i]; } for (ll i = 1; i <= llN; i++) { cin >> g_llY[i]; llSum2+=g_llY[i]; } ll llAns = (llSum1-llSum2+llN*llC)/(2*llN); ll llL = (llSum1-llSum2+llN*llC)-llAns*2*llN; ll llR = (llAns+1)*2*llN-(llSum1-llSum2+llN*llC); if (llL<=llR) { cout << llAns << " " << llC-llAns << endl; } else { cout << llAns+1 << " " << llC-(llAns-1) << endl; } return 0; }