{"push_id":2685824273,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"22de3c6723d631731d80ace9396f17bb338901ee","before":"b66f05254d2bad675908c2d456599ca63a0cb7f2","commits":[{"sha":"22de3c6723d631731d80ace9396f17bb338901ee","author":{"name":"Dmitrii Voitovich","email":"c60905083cd500bf872851e8a95e78fe195375fc@mail.ru"},"message":"Update BerSU Ball.py\n\nBerSU Ball\r\ntime limit per test1 second\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nThe Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves.\r\n\r\nWe know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one.\r\n\r\nFor each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from n boys and m girls.\r\n\r\nInput\r\nThe first line contains an integer n (1 ≤ n ≤ 100) — the number of boys. The second line contains sequence a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is the i-th boy's dancing skill.\r\n\r\nSimilarly, the third line contains an integer m (1 ≤ m ≤ 100) — the number of girls. The fourth line contains sequence b1, b2, ..., bm (1 ≤ bj ≤ 100), where bj is the j-th girl's dancing skill.\r\n\r\nOutput\r\nPrint a single number — the required maximum possible number of pairs.","distinct":true,"url":"https://api.github.com/repos/Dzokaredevil/Codeforces/commits/22de3c6723d631731d80ace9396f17bb338901ee"}]}
{"actor":{"display_login":"Dzokaredevil"}}