Language: C++

/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
					*/

#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printfin(a) printf(a ? "possible\n" : "inposible\n")
#define all(x) (x).begin(), (x).end()
using ll = long long;

const int INF = 2147483647;
//const ll LINF = ll();今度書く

//マクロとかここまで

#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <map>

using namespace std;

int main() {

	int n, m;
	char tmp[110];
	map<char[110], int> s;
	scanf("%d", &n);
	rep(i, n) {
		scanf("%s", tmp);
		++s[tmp];
	}
	rep(i, m) {
		scanf("%s", tmp);
		--s[tmp];
	}
	printf("%d\n", *max_element(all(s)));

	return 0;
}


Compiler output:
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
                 from /usr/include/c++/14/string:68,
                 from a.cc:31:
/usr/include/c++/14/tuple: In instantiation of 'std::pair<_T1, _T2>::pair(std::tuple<_Args1 ...>&, std::tuple<_Args2 ...>&, std::_Index_tuple<_Indexes1 ...>, std::_Index_tuple<_Indexes2 ...>) [with _Args1 = {const char (&)[110]}; long unsigned int ..._Indexes1 = {0}; _Args2 = {}; long unsigned int ..._Indexes2 = {}; _T1 = const char [110]; _T2 = int]':
/usr/include/c++/14/tuple:2879:63:   required from 'std::pair<_T1, _T2>::pair(std::piecewise_construct_t, std::tuple<_Args1 ...>, std::tuple<_Args2 ...>) [with _Args1 = {const char (&)[110]}; _Args2 = {}; _T1 = const char [110]; _T2 = int]'
 2879 |              typename _Build_index_tuple<sizeof...(_Args2)>::__type())
      |                                                                      ^
/usr/include/c++/14/bits/new_allocator.h:191:4:   required from 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::pair<const char [110], int>; _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Tp = std::_Rb_tree_node<std::pair<const char [110], int> >]'
  191 |         { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/alloc_traits.h:575:17:   required from 'static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const char [110], int>; _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Tp = std::_Rb_tree_node<std::pair<const char [110], int> >; allocator_type = std::allocator<std::_Rb_tree_node<std::pair<const char [110], int> > >]'
  575 |           __a.construct(__p, std::forward<_Args>(__args)...);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:593:32:   required from 'void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(_Link_type, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Key = char [110]; _Val = std::pair<const char [110], int>; _KeyOfValue = std::_Select1st<std::pair<const char [110], int> >; _Compare = std::less<char [110]>; _Alloc = std::allocator<std::pair<const char [110], int> >; _Link_type = std::_Rb_tree_node<std::pair<const char [110], int> >*]'
  593 |               _Alloc_traits::construct(_M_get_Node_allocator(),
      |               ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
  594 |                                        __node->_M_valptr(),
      |                                        ~~~~~~~~~~~~~~~~~~~~
  595 |                                        std::forward<_Args>(__args)...);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:610:21:   required from 'std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(_Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Key = char [110]; _Val = std::pair<const char [110], int>; _KeyOfValue = std::_Select1st<std::pair<const char [110], int> >; _Compare = std::less<char [110]>; _Alloc = std::allocator<std::pair<const char [110], int> >; _Link_type = std::_Rb_tree_node<std::pair<const char [110], int> >*]'
  610 |           _M_construct_node(__tmp, std::forward<_Args>(__args)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:1633:32:   required from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Auto_node::_Auto_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Key = char [110]; _Val = std::pair<const char [110], int>; _KeyOfValue = std::_Select1st<std::pair<const char [110], int> >; _Compare = std::less<char [110]>; _Alloc = std::allocator<std::pair<const char [110], int> >]'
 1633 |             _M_node(__t._M_create_node(std::forward<_Args>(__args)...))
      |                     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:2460:13:   required from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const char (&)[110]>, std::tuple<>}; _Key = char [110]; _Val = std::pair<const char [110], int>; _KeyOfValue = std::_Select1st<std::pair<const char [110], int> >; _Compare = std::less<char [110]>; _Alloc = std::allocator<std::pair<const char [110], int> >; iterator = std::_Rb_tree<char [110], std::pair<const char [110], int>, std::_Select1st<std::pair<const char [110], int> >, std::less<char [110]>, std::allocator<std::pair<const char [110], int> > >::iterator; const_iterator = std::_Rb_tree<char [110], std::pair<const char [110], int>, std::_Select1st<std::pair<const char [110], int> >, std::less<char [110]>, std::allocator<std::pair<const char [110], int> > >::const_iterator]'
 2460 |         _Auto_node __z(*this, std::forward<_Args>(__args)...);
      |                    ^~~
/usr/include/c++/14/bits/stl_map.h:513:37:   required from 'std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = char [110]; _Tp = int; _Compare = std::less<char [110]>; _Alloc = std::allocator<std::pair<const char [110], int> >; mapped_type = int; key_type = char [110]]'
  513 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  514 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  515 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
a.cc:47:10:   required from here
   47 |                 ++s[tmp];
      |                        ^
/usr/include/c++/14/tuple:2889:9: error: array used as initializer
 2889 |       : first(std::forward<_Args1>(std::get<_Indexes1>(__tuple1))...),
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~