大意:在一坨硬币中,只能找2个硬币,刚刚好和它给的价格相等,找到就输出有两枚硬币中的一枚最小的硬币的组合,否则就输出No Solution咯。
能用STL函数就不自己写(抠鼻)
# include <iostream>
# include <vector>
# include <algorithm>
using namespace std;
int N;
int Amount;
vector<int> Coins;
vector<pair<int, int> > rst;
int main()
{
cin >> N >> Amount;
for(int i=0;i<N;++i){
int coin;
cin >> coin;
Coins.push_back(coin);
}
sort(Coins.begin(), Coins.end());
for(int i=0;i<N;++i){
vector<int>::iterator j = lower_bound(Coins.begin(), Coins.end(), Amount-Coins[i]);
// j-Coins.begin() != i找到的不是同一个位置上的硬币
if(*j + Coins[i] == Amount && j-Coins.begin() != i)
rst.push_back({Coins[i], *j});
}
if(rst.size() == 0)
cout << "No Solution\n";
else
cout << rst[0].first << " " << rst[0].second << endl;
return 0;
}
还是自己写一个吧hhhhhhhhh
# include <iostream>
# include <vector>
# include <algorithm>
# include <set>
using namespace std;
int N;
int Amount;
vector<int> Coins;
vector<pair<int, int> > rst;
int BiSearch(int l, int r, int x)
{
int mid;
while(l <= r)
{
mid = (l + r) / 2;
if(Coins[mid] == x)
return mid;
else
if(Coins[mid] > x)
r = mid - 1;
else
l = mid + 1;
}
return -1;
}
int main()
{
cin >> N >> Amount;
for(int i=0;i<N;++i){
int coin;
cin >> coin;
Coins.push_back(coin);
}
sort(Coins.begin(), Coins.end());
for(int i=0;i<N;++i){
int j = BiSearch(0, N-1, Amount-Coins[i]);
if(j != -1 && j != i)
rst.push_back({Coins[i], Coins[j]});
}
if(rst.size() == 0)
cout << "No Solution\n";
else
cout << rst[0].first << " " << rst[0].second << endl;
return 0;
}