PAT甲级1048. Find Coins (25)
来源:互联网 发布:mac怎么关闭开机声音 编辑:程序博客网 时间:2024/06/06 10:52
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
和 leetcode的two sums那题类似。
#include <cstdio>using namespace std;#include <vector>#include <algorithm>int main(){ int N,M; scanf("%d %d",&N,&M); vector<int> V(N); for(int i=0;i<N;i++) scanf("%d",&V[i]); sort(V.begin(),V.end()); int i=0,j=N-1,flag=0; while(i<j){ if(V[i]+V[j]==M) { printf("%d %d",V[i],V[j]); flag=1; break; } else if(V[i]+V[j]>M) j--; else i++; } if(!flag) printf("No Solution"); return 0;}
- 【PAT甲级】1048. Find Coins (25)
- 1048. Find Coins (25) PAT 甲级
- PAT(甲级)1048. Find Coins (25)
- PAT甲级练习1048. Find Coins (25)
- PAT甲级1048. Find Coins (25)
- 1048. Find Coins (25)-PAT甲级
- PAT 甲级 1048. Find Coins (25)
- PAT甲级 1048. Find Coins (25)
- 1048. Find Coins (25)-PAT甲级真题
- 1048. Find Coins (25)-PAT
- 【PAT】1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- pat 1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- pat 1048. Find Coins (25)
- 1048. Find Coins (25)-PAT甲级真题(Hash散列)
- PAT甲级1068. Find More Coins (30)
- bzoj2818
- [POJ1845]Sumdiv(数论+矩乘)
- 蓝桥杯 Beaver's Calculator By Assassin 归并排序
- P2P通信
- 编程知识收藏
- PAT甲级1048. Find Coins (25)
- nachos-java Task1.3 Alarm
- HDU6016Count the Sheep
- 【数据结构】:排序--交换排序
- POJ 1836-Alignment(LIS-士兵列队)
- BZOJ 1568 [JSOI2008]Blue Mary开公司 标记永久化线段树
- DES算法
- 一个关于按位或的故事~~(QDU-码农必修)
- 【NOI2001】炮兵阵地