# 浙大pat | 浙大pat 牛客网PAT顶级(Top Level)练习题 1003 博弈论

You class are planning for a spring outing. N people are votingfor a

destination out of K candidate places.

The voting progress isbelow:

First the class vote forthe first candidate place. If more than half

of the class agreed on the place, the place is selected. Thevoting ends.

Otherwise they vote forthe second candidate place. If more than half

of the class agreed on the place, the place is selected. Thevoting ends.

Otherwise they vote forthe third candidate place in the same way and

go on.

If no place is selectedat last there will be no spring outing and

everybody stays at home.

Before the voting, theChief Entertainment Officer did a survey, found

out every one's preference which can be represented as apermutation of

0, 1, ... K. (0 is for staying at home.) For example, when K=3,

preference "1, 0, 2, 3" means that the first place ishis

first choice, staying at home is the second choice, the secondplace is

the third choice and the third place is the last choice.

The Chief EntertainmentOfficer sends the survey results to the class.

So everybody knows the others' preferences. Everybody wants hismore

prefered place to be selected. And they are very smart, theyalways

choose the optimal strategy in the voting progress to achievehis goal.

Can you predict whichplace will be selected?

The first line contains two integers, N and K, the number ofpeople in your class and the number of candidate places.
The next N lines each contain a permutation of 0~K, representing someone'spreference.
For 40% of the data, 1 <= N, K <= 10
For 100% of the data, 1 <= N, K <= 1000

Output the selected place. Or "otaku" without quotesif no place is selected.

In the sample case, if the second peoson vote against the first place, no placewould be selected finally because the first person must vote against the secondplace for his own interest. Considering staying at home is a worse choice thanthe first place, the second person's optimal strategy is voting for the firstplace. So the first place will be selected

2 2
1 0 2
2 1 0

1

#include<iostream>

#include<vector>

#include<unordered_map>

using namespacestd;

int main()

{

//0 2 4 5 3 1

int N, K,tmp;

while (cin >> N >> K)

{

vector<unordered_map<int,int>> theLike(N);

for (int i = 0; i < N; i++)

{

for (int j = 0; j < K + 1;j++)

{

cin >> tmp;

theLike[i][tmp] = j;

}

}

int theWinNum = 0;

for (int i = K; i >= 1; i--)

{

int count = 0;

for (int j = 0; j < N; j++)

{

if (theLike[j][i] <theLike[j][theWinNum])count++;

}

if (count > N / 2)

{

theWinNum = i;

}

}

if (theWinNum > 0)

cout <<theWinNum<<endl;

else

cout <<"otaku"<<endl;

}

return 0;

}