Karuselli

#include <iostream>
#include <vector>
using namespace std;
long n, m, o, p, k;
long m1[101010], m2[101010];
int main() {
	cin >> n >> k;
	//for (int i = 1; i <= n; i++) {
		for (int a = 1; a <= k; a++) {
			cin >> m1[a];
		}
		for (int a = 1; a <= k; a++) {
			cin >> m2[a];
		}	
			//v[i].push_back({a, i});
	
	for (int a = 1; a <= k; a++) {
		for (int b = 1; b <= k; b++) {
			if (a == b) continue;
			p = max(m1[a] + m2[b], p);
		}
	}
	cout << p << endl;
}//:D

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED