7-1 Fake News

No news site is unbiased, but some do a better job of trying to balance facts and opinions. The term fake news means "news articles that are intentionally and verifiably false" designed to manipulate people's perceptions of real facts, events, and statements. (Quoted from https://www.cits.ucsb.edu/fake-news/what-is-fake-news)

To tell if a news media is more or less likely to be fake, you can keep an eye on several different sites to see how they report on the same important events. The algorithm works as the following:

• Select N news sites.
• For each important event, scan every site and represent each different opinion by a distinct integer.
• Define the likelihood of a site i being fake news by Fi​=ni​/N, where ni​ is the number of sites that have different opinions than site i.
• Find the news site(s) which is(are) the most likely to report fake news.
• For each news site, count the number of times it was the most likely to be fake, and find the one that is in most of the cases the most likely to be fake.

Input Specification:

Each input file contains one test case. For each case, the first line contains two positive numbers: N (≤104) which is the number of news sites, and M (≤100) which is the number of events. Then M lines follow, each describes the reports of the sites in the format:

R1​ R2​ ... RN​

where Ri​ is an integer in the range [−104,104], and reprensts the opinion of site i.

Output Specification:

For each test case, print in a line the index of the site which is in most of the cases the most likely to be fake. The answer is guaranteed to be unique.

Sample Input:

4 6
4 2 7 7
1 1 1 3
2 9 9 5
-1 -1 -1 -1
-2 2 -2 2
1 1 3 4

Sample Output:

4

Event 1: 3/4 3/4 2/4 2/4 --> 1 and 2 are the most likely
Event 2: 1/4 1/4 1/4 3/4 --> 4 is the most likely
Event 3: 3/4 2/4 2/4 3/4 --> 1 and 4 are the most likely
Event 4: 0 0 0 0 --> all are the most likely
Event 5: 2/4 2/4 2/4 2/4 --> all are the most likely
Event 6: 2/4 2/4 3/4 3/4 --> 3 and 4 are the most likely
 

#include<iostream>
#include<unordered_map>
#include<vector>
using namespace std;
const int N = 10010;
int r[N];
int n,m,most_fake;
unordered_map<int,int> fake_cnt;
int main(){
    cin>>n>>m;
    while(m--){
        vector<int> may_fake;
        unordered_map<int,int> cnt;
        for(int i = 1;i<=n;i++) {
            cin>>r[i];
            cnt[r[i]]++;
        }
        double fake_p = -1;
        for(int i = 1;i<=n;i++){
           double p = (n-cnt[r[i]])*1.0/n;
           if(p>fake_p){
               may_fake.clear();
               fake_p = p;
               may_fake.push_back(i);
           }else if(p==fake_p){
               may_fake.push_back(i);
           }
        }
        for(auto t:may_fake){
            fake_cnt[t]++;
        }
    }
    int res = 0;
    for(auto t:fake_cnt){
        int id = t.first;
        int cnt = t.second;
        if(cnt>res){
            res = cnt;
            most_fake = id;
        }
    }
    cout<<most_fake<<endl;
}