提交记录 #87

编译情况：编译成功

code.c: In function ‘main’:
code.c:9:9: warning: unused variable ‘w’ [-Wunused-variable]
    9 |     int w = 0;
      |         ^

固定测试点#1:

Accepted

0.000s

236 kB

固定测试点#2:

Accepted

0.000s

236 kB

额外测试点#3:

Wrong Answer

0.000s

496 kB

31【大学】北理工的恶龙

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    int longtou[100];
    int shengao[100];
    int w = 0;
    //input两个的值
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &longtou[i]);
    }
    for (int i = 0; i < m; i++)
    {
        scanf("%d", &shengao[i]);
    }
    //按从小到大排列龙头
    for (int p = 0; p < n - 1; p++)
    {
        for (int q = 0; q < n - 1 - p; q++)
        {    
            if (longtou[q] > longtou[q + 1])
            {
                int shu = longtou[q];
                longtou[q] = longtou[q + 1];
                longtou[q + 1] = shu;
            }
        }
    }
    //按从小到大排列身高
    for (int p = 0; p < m - 1; p++)
    {
        for (int q = 0; q < m - 1 - p; q++)
        {
            if (shengao[q] > shengao[q + 1])
            {
                int shu = shengao[q];
                shengao[q] = shengao[q + 1];
                shengao[q + 1] = shu;
            }
        }
    }
    //判断龙头身高
    int sum = 0;
    int y = 0; 
    for (int i = 0; i < n; i++) 
    {
        for (int j = y; j < m; j++) 
        {
            if (longtou[i] <= shengao[j]) 
            {
                sum += shengao[j];
                y = j + 1; 
                break; 
            }
        }
    }

    if (y == n) 
    {
        printf("%d\n", sum);
    }
    else {
        printf("bit is doomed!\n");
    }

    return 0;
}