Dice Cup

#include <bits/stdc++.h>

using namespace std;

int main(){
	int n, m; cin >> n >> m;
	unordered_map<int, int> lol;
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= m; ++j){
			lol[i+j]++;
		}
	}
	vector<pair<int, int>> lel;
	int ma = 0;
	for(auto f:lol)
	       ma = max(ma, f.second);
	for(auto f : lol){
		if(f.second == ma)
			cout << f.first << "\n";
	}	
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED