zoukankan      html  css  js  c++  java
  • D

    Description

    The 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.

    We 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.

    For 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.

    Input

    The 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.

    Similarly, 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.

    Output

    Print a single number — the required maximum possible number of pairs.

    Sample Input

    Input
    4
    1 4 6 2
    5
    5 1 5 7 9
    Output
    3
    Input
    4
    1 2 3 4
    4
    10 11 12 13
    Output
    0
    Input
    5
    1 1 1 1 1
    3
    1 2 3
    Output
    2
     
    #include<stdio.h>
    int a[110],b[110];
    void sortquickly(int a[],int lenth)
    {
        int mid;
        mid = a[0];
        int i,j;
        i=0;
        j=lenth-1;
        if(lenth>1)
        {
            while(i<j)
            {
                for(; j>i; j--)
                {
                    if(a[j]<mid)
                    {
                        a[i++]=a[j];
                        break;
                    }
                }
                for(; i<j; i++)
                {
                    if(a[i]>mid)
                    {
                        a[j--]=a[i];
                        break;
                    }
                }
            }
            a[i]=mid;
            sortquickly(a,i);
            sortquickly(a+i+1,lenth-i-1);
        }
    }
    
    int function(int a[],int b[],int n,int m)
    {
        int i,t,k=0;
        for(i=0; i<n; i++)
        {
            for(t=0; t<m; t++)
            {
                if(a[i]==b[t]-1)
                {
                    k=k+1;
                    b[t]=-5;
                    break;
                }
                else if(a[i]==b[t])
                {
                    k=k+1;
                    b[t]=-5;
                    break;
                }
                else if(a[i]==b[t]+1)
                {
                    k=k+1;
                    b[t]=-5;
                    break;
                }
            }
        }
        return k;
    }
    int main()
    {
        int n,m,i,t;
        scanf("%d",&n);
        for(i=0; i<n; i++)
            scanf("%d",&a[i]);
        scanf("%d",&m);
        for(i=0; i<m; i++)
            scanf("%d",&b[i]);
        sortquickly(a,n);
        sortquickly(b,m);
        t=function(a,b,n,m);
        printf("%d",t);
        return 0;
    }
  • 相关阅读:
    离线安装MariaDB 10.4.13
    YUM 的使用
    Crontab 定时任务
    静默安装卸载 ORACLE
    java 改变图片的DPI
    Java TIF、JPG、PNG等图片转换
    key可重复的Map
    集合对象去重
    Java创建TXT文件并写入 内容
    Java已知图片路径下载图片到本地
  • 原文地址:https://www.cnblogs.com/dongq/p/4140328.html
Copyright © 2011-2022 走看看