PAT甲级刷题记录——1048 Find Coins (25分)

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​5​​ 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​5​​ , the total number of coins) and M (≤10​3​​ , 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​1​​ and V​2​​ (separated by a space) such that V​1​​ +V​2​​ =M and V​1​​ ≤V​2​​ . If such a solution is not unique, output the one with the smallest V​1​​ . If there is no solution, output No Solutioninstead.

Sample Input 1:

8 15
1 2 8 7 2 4 11 15

Sample Output 1:

4 11

Sample Input 2:

7 14
1 8 7 2 4 11 15

Sample Output 2:

No Solution

思路

这题也很简单,就是给你一个数字M,让你在给出的序列里挑满足V1+V2=M的两个数,并且V1要尽可能小。那么受到【1085 Perfect Sequence (25分)】的启发,我这题用了lower_bound()函数来做。

首先,肯定是先把输入的序列从小到大排序(题目没说输入的一定是有序的,所以要自己先排个序),然后从头开始找,先选一个数a[i],再从剩下的序列里看看是否存在一个数a[j],使得a[i]+a[j]==M,因此,我们只需要用lower_bound()函数来找到第一个大于等于M-a[i]的数的位置即可。

但要注意的是,因为即便这个数不存在,lower_bound()还是会返回假设这个数存在时的位置,因此,在用完lower_bound()函数求出位置之后,还需要再判断一下,是不是当前这个位置的数确实满足要求,并且不是它本身,那么就直接输出然后break掉即可(因为是从小到大排序之后,从头开始挑的,这样就自动满足了输出V1较小者的解),如果循环完了还没找到一种可行方案,就输出No Solution

代码

#include<cstdio>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn = 100010;
int data[maxn] = {0};
int main()
{
    int N, M;
    scanf("%d%d", &N, &M);
    for(int i=0;i<N;i++){
        scanf("%d", &data[i]);
    }
    sort(data, data+N);
    bool flag = false;
    for(int i=0;i<N;i++){
        int pos = lower_bound(data, data+N, M-data[i]) - data;
        if(data[i]+data[pos]==M&&i!=pos){//如果能满足要求,且不是自己加自己
            flag = true;
            printf("%d %d", data[i], data[pos]);
            break;
        }
    }
    if(flag==false) printf("No Solution");
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值