Karuselli

#include <iostream>
#include <vector>
#include <map>
using namespace std;
long n, m, o, p, k;
map<long, int> ma1, ma2;
int main() {
	cin >> n >> k;
	//for (int i = 1; i <= n; i++) {
	if (n == 1) {
		for (int a = 1; a <= k; a++) {
			cin >> o;
			p = max(p, o);
		}
	} else {
		for (int a = 1; a <= k; a++) {
			cin >> o;
			ma1.insert({o,a});
		}
		for (int a = 1; a <= k; a++) {
			cin >> o;
			ma2.insert({o,a});
		}	
			//v[i].push_back({a, i});
	
		auto it1 = ma1.end();
		while (it1 != ma1.begin()) {
			for (auto u: ma2) {
				if (u.second == it1->second) continue;
				p = max(p, it1->first + u.first);
			}
			--it1;
		}
	}
	cout << p << endl;
}//:D

Test 1

Group: 1

Verdict: ACCEPTED

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: ACCEPTED

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