1048 Find Coins (25 point(s)) - C语言 PAT 甲级

最新推荐文章于 2021-08-20 17:23:24 发布

有三只土豆

最新推荐文章于 2021-08-20 17:23:24 发布

阅读量172

点赞数

分类专栏： PAT 甲级文章标签： C语言甲级 PAT

本文链接：https://blog.csdn.net/huaxuewan/article/details/102944226

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1048 Find Coins (25 point(s))

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 10⁵ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤ 10⁵, the total number of coins) and M (≤ 10³, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the two face values V₁ and V₂ (separated by a space) such that V₁ + V₂ = M and V₁ ≤ V₂. If such a solution is not unique, output the one with the smallest V₁. If there is no solution, output No Solution instead.

Sample Input:

8 15
1 2 8 7 2 4 11 15

Sample Output:

4 11

Sample Input:

7 14
1 8 7 2 4 11 15

Sample Output:

No Solution

题目大意：

输入 N 个数，求两个数 V₁ + V₂ = M 且 V₁ ≤ V₂，若有多对，则输出 V₁ 最小的一对

设计思路：

利用数组和数组索引存每个数出现的次数，遍历寻找到第一对符合条件的，即可输出，
因为遍历过程中，索引从小到大，相当于数值从小到大遍历，可以保证 V₁ 是最小值

编译器：C (gcc)

#include <stdio.h>

int main(void)
{
        int n, m, temp;
        int map[501] = {0};
        int i;

        scanf("%d %d", &n, &m);
        for (i = 0; i < n; i++) {
                scanf("%d", &temp);
                map[temp]++;
        }

        for (i = 0; i < 501; i++) {
                if (map[i]) {
                        map[i]--;
                        temp = m - i;
                        if (0 <= temp && temp <= 500 && map[temp]) {
                                printf("%d %d", i, temp);
                                return 0;
                        }
                        map[i]++;
                }
        }
        printf("No Solution");

        return 0;
}