题解 | Spring Outing

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    // 处理投票过程
    void processVotes(const vector<vector<int>>& preferences, int n, int k, int& result) {
        for (int candidate = k; candidate > 0; candidate--) {
            int votes = 0;
            // 统计支持当前候选人的票数
            for (int i = 0; i < n; i++) {
                if (preferences[i][candidate] < preferences[i][result]) {
                    votes++;
                }
            }
            // 如果获得超过半数支持，更新结果
            if (votes > n / 2) {
                result = candidate;
            }
        }
    }

    void solve() {
        int n, k;
        while (cin >> n >> k) {
            // 存储每个人的偏好
            vector<vector<int>> preferences(n, vector<int>(k + 1, 0));
            
            // 读取并处理输入
            for (int i = 0; i < n; i++) {
                for (int j = 0; j <= k; j++) {
                    int temp;
                    cin >> temp;
                    preferences[i][temp] = j;  // 记录排名
                }
            }

            // 处理投票
            int result = 0;  // 初始结果为留在家里
            processVotes(preferences, n, k, result);

            // 输出结果
            cout << (result ? to_string(result) : "otaku") << endl;
        }
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    Solution solution;
    solution.solve();
    
    return 0;
}

import java.util.*;

public class Main {
    static class Solution {
        private void processVotes(int[][] preferences, int n, int k, int[] result) {
            for (int candidate = k; candidate > 0; candidate--) {
                int votes = 0;
                for (int i = 0; i < n; i++) {
                    if (preferences[i][candidate] < preferences[i][result[0]]) {
                        votes++;
                    }
                }
                if (votes > n / 2) {
                    result[0] = candidate;
                }
            }
        }

        public void solve(Scanner sc) {
            while (sc.hasNext()) {
                int n = sc.nextInt();
                int k = sc.nextInt();

                int[][] preferences = new int[n][k + 1];
                
                // 读取并处理输入
                for (int i = 0; i < n; i++) {
                    for (int j = 0; j <= k; j++) {
                        int temp = sc.nextInt();
                        preferences[i][temp] = j;
                    }
                }

                // 使用数组来模拟引用传递
                int[] result = {0};
                processVotes(preferences, n, k, result);

                // 输出结果
                System.out.println(result[0] == 0 ? "otaku" : result[0]);
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Solution solution = new Solution();
        solution.solve(sc);
        sc.close();
    }
}

def process_votes(preferences: list, n: int, k: int) -> int:
    result = 0
    for candidate in range(k, 0, -1):
        votes = sum(1 for i in range(n) 
                   if preferences[i][candidate] < preferences[i][result])
        if votes > n // 2:
            result = candidate
    return result

def solve():
    n, k = map(int, input().split())
    
    preferences = [[0] * (k + 1) for _ in range(n)]
    for i in range(n):
        temp = list(map(int, input().split()))
        for j, val in enumerate(temp):
            preferences[i][val] = j
    
    result = process_votes(preferences, n, k)
    print(result if result else "otaku")

while True:
    try:
        solve()
    except EOFError:
        break