Hackerrank-Leetcode/BeautifulPairs.cpp at master · skanda99/Hackerrank-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81

// problem: "https://www.hackerrank.com/challenges/beautiful-pairs/problem"

#include<iostream>

using namespace std;

int main()
{
    int N,i,j,ca[1005],cb[1005],n,sum,x,y;


    for(i=0;i<1005;i++)
    {
        ca[i]=cb[i]=0;
    }

    cin>>N;

    for(i=0;i<N;i++)
    {
        cin>>n;
        ca[n]++;
    }

    for(j=0;j<N;j++)
    {
        cin>>n;
        cb[n]++;
    }

    j=sum=0;

    /*
    for(i=0;i<=1000;i++)
        cout<<ca[i]<< " ";

    cout<<endl;


    for(i=0;i<=1000;i++)
        cout<<cb[i]<< " ";
    */

    x=y=0;

    for(i=1;i<=1000;i++)
    {

        sum=sum+min(ca[i],cb[i]);

        if(ca[i]>cb[i])
            x=1;

        if(ca[i]<cb[i])
            y=1;

    }
    /*
    int c=0;
    cout<<endl;
    for(i=0;i<1001;i++)
        c=c+ca[i];

    cout<<c;

    cout<<endl;
    */
    if((x==1)&&(y==1))
        sum++;
    else
        sum--;

    if(N!=1)
        cout<<sum<<endl;
    else
        cout<<0<<endl;

    return 0;
}