백준 11637번 인기 투표 C++

https://www.acmicpc.net/problem/11637

11637번: 인기 투표

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int maxVal = 0;
        int sum = 0;
        int maxIdx = -1;
        bool same = false;
        for (int i = 1; i <= n; i++) {
            int val;
            cin >> val;
            sum += val;
            if (val == maxVal) {
                same = true;
            }
            else if (val > maxVal) {
                maxIdx = i;
                maxVal = val;
                same = false;
            }
        }
        if (same) cout << "no winner\n";
        else {
            sum -= maxVal;
            if (sum < maxVal) cout << "majority winner " << maxIdx << "\n";
            else cout << "minority winner " << maxIdx << "\n";
        }
    }
}