zoukankan      html  css  js  c++  java
  • 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 1 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 (≤, the total number of coins) and M (≤, 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 V1​​ and V2​​ (separated by a space) such that V1​​+V2​​=M and V1​​V2​​. If such a solution is not unique, output the one with the smallest V1​​. If there is no solution, output No Solution instead.

    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
     
      two pointers
     
     
    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=100010;
    int coin[maxn];
    int main(){
        int n,m;
        cin>>n>>m;
        for(int i=0;i<n;i++){
            cin>>coin[i];
        }
        sort(coin,coin+n);
        int l=0,r=n-1;
        int flag=0;
        while(l<r){
            if(coin[l]+coin[r]==m){
                printf("%d %d
    ",coin[l],coin[r]);
                flag=1;
                l++;
                r--;
                break;
            }
            else if(coin[l]+coin[r]>m){
                r--;
            }
            else if(coin[l]+coin[r]<m){
                l++;
            }
        }
        if(flag==0){
            printf("No Solution
    ");
        }
        return 0;
    }
  • 相关阅读:
    常量
    语音合成技术(深度学习方法简介)
    在 Linux 上如何清除内存的 Cache、Buffer 和交换空间
    Bash Bang (!) commands(bash的“!”命令,重新运行前一个命令的全部或部分。)
    Ubuntu apt pip conda 代理设置
    rsync 远程数据同步
    设置 jupyter notebook 可远程访问
    ubuntu 挂载硬盘(GPT分区,大于2T的硬盘)
    用树结构构造一篇文章(待完成)
    数组切分(句子拼接)
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14454430.html
Copyright © 2011-2022 走看看