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 105 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 (<=105, the total number of coins) and M(<=103, 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

    题目比1044简单,顺序中拿两个数看他们的和是否是M,而1044的则是可能需要拿多个数的和为M。

    #include<iostream>
    #include<queue>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    struct point{
    	int s_v;
    	int f_v;
    };
    vector<int>v;
    vector<point>rese;
    bool cmp(point a,point b){
    	return a.s_v<b.s_v;
    }
    int main(){
    	int n,m;
    	scanf("%d%d",&n,&m);
    	int i,j;
    	int value;
    	for(i=0;i<n;i++){
    		scanf("%d",&value);
    		v.push_back(value);
    	}
    	int sum=0;
    	bool flag = true;
    	int first=v[0];
    	int second;
    	i=1;
    	while(i!=n){
    		second=v[i++];
    		if(first+second==m){
    			if(first>second){
    				int tmp=first;
    				first=second;
    				second=tmp;
    			} 
    			point p;
    			p.s_v=first;
    			p.f_v=second;
    			rese.push_back(p);
    			flag=false;
    		}
    		else{
    			first=second;
    		}
    	}
    	if(flag){
    		printf("No Solution
    ");
    	}else {
    		sort(rese.begin(),rese.end(),cmp);
    		//sort(rese.begin(),rese.end().cmp1);
    		printf("%d %d
    ",rese[0].s_v,rese[0].f_v);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    SQL Server 存储过程
    SQL数据类型介绍
    XML文件操作指南
    C# 程序集 与 反射
    详解C#中System.IO.File类和System.IO.FileInfo类的用法
    C# 之泛型详解
    C#中HashTable的用法示例2
    C#中HashTable的用法示例1
    DEDECMS5.7 首页和栏目页调用文章按权重排序
    linux创建用户,指定组
  • 原文地址:https://www.cnblogs.com/grglym/p/7776732.html
Copyright © 2011-2022 走看看