# coding practice SRM494

Mr. White is a very versatile person – absolutely everything is interesting to him. Perhaps this is why he has many friends. Quite unfortunately, however, none of his friends are versatile at all. Each of them is interested only in two topics and refuses to talk about anything else. Therefore, each time Mr. White organizes a party, it’s a big problem for him to decide whom to invite so that the party is interesting to everybody. Now that Mr. White has a lot of experience in organizing parties, he knows for sure that a party will be interesting if and only if there’s a topic interesting to each of the invited friends.

#include <vector>
#include <string>
using namespacee std;

class InterestingParty {
public:
int bestInvitation(vector <string> first, vector <string> second) {
int i, j;
int ans = 0;

for(i=0; i<first.size(); i++){
int f=0;
int s=0;
for(j=0; j<first.size(); j++){
if(first[i] == first[j]) f++;
if(first[i] == second[j]) f++;
if(second[i] == first[j]) s++;
if(second[i] == second[j]) s++;
}
ans = max(f, ans);
ans = max(s, ans);
}
return ans;
}
}

#include <vector>
#include <map>
#include <string>
#include <algorithm>
using namespacee std;

class InterestingParty {
public:
int bestInvitation(vector <string> first, vector <string> second) {
map <string, int> dic;

for(int i=0; i<first.size(); i++){
dic[first[i]] = 0;
dic[second[i]] = 0;
}

for(int i=0; i<first.size; i++){
dic[first[i]]++;
dic[second[i]]++;
}
int ans = 0;
map <string, int>::iterator it;
for(it=dic.begin(); it!=dic.end(); it++){
ans = max(ans, it->second);
}
return ans;
}
}