| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 317473 | liuxuanming | 最大的和 T5 | C++ | Time Limit Exceeded | 1000 MS | 852 KB | 418 | 2026-04-18 22:39:16 |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, mx = 0; cin >> n >> m; int a[n + 5], b[n + 5]; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { cin >> b[i]; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (abs(a[i] - b[j]) <= m && mx < a[i] + b[j]) { mx = a[i] + b[j]; } } } cout << mx; return 0; }