PAT A1048 Find Coins 三种方法

贪心

 

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<bits/stdc++.h>

using namespace std;
bool cmp(int a, int b)
{
	return a > b;
 }
int main()
{
	
	
	int hashTable[510] = {0};
	int nums[100010];
	int N,M;
	scanf("%d %d", &N,&M);
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &nums[i]);
		hashTable[nums[i]]++;
	}
	vector<int> anss;
	int mmin = 1000;
	for (int i = 0; i < N; i++)
	{
		hashTable[nums[i]]--;
		if (M - nums[i]>=0&&M - nums[i]<=500&&hashTable[M - nums[i]]>0)
		{
			int t = min(nums[i], M - nums[i]);
			mmin = min(t, mmin);
		}
	}
	if (mmin != 1000)
	{
		cout << mmin << " " << M - mmin;
	}
	else {
		cout << "No Solution";
	}

	return 0;
}

二分

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<bits/stdc++.h>

using namespace std;
bool cmp(int a, int b)
{
	return a > b;
}
int binfind(int arr[], int left, int right,int x)
{
	while (left <= right)
	{
		int mid = left + (right - left) / 2;
		if (arr[mid] > x)
		{
			right = mid - 1;
		}
		else if (arr[mid] < x)
		{
			left = mid + 1;
		}
		else {
			return mid;
		}
	}
	return -1;
}
int main()
{
	freopen("in.txt", "r", stdin);
	
	int nums[100010];
	int N, M;
	scanf("%d %d", &N, &M);
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &nums[i]);
		
	}
	sort(nums, nums + N);
	







	vector<int> anss;
	int mmin = 1000;

	for (int i = 0; i < N; i++)
	{
		int index=binfind(nums, 0, N - 1, M - nums[i]);
		if (index == -1||index==i)
			continue;
		int t = min(nums[index], M - nums[index]);
		mmin = min(t, mmin);
	}
	if (mmin != 1000)
	{
		cout << mmin << " " << M - mmin;
	}
	else {
		cout << "No Solution";
	}
	fclose(stdin);
	return 0;
}

Two points

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<bits/stdc++.h>

using namespace std;
bool cmp(int a, int b)
{
	return a > b;
}
int binfind(int arr[], int left, int right, int x)
{
	while (left <= right)
	{
		int mid = left + (right - left) / 2;
		if (arr[mid] > x)
		{
			right = mid - 1;
		}
		else if (arr[mid] < x)
		{
			left = mid + 1;
		}
		else {
			return mid;
		}
	}
	return -1;
}
int main()
{

	
	int nums[100010];
	int N, M;
	scanf("%d %d", &N, &M);
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &nums[i]);

	}
	sort(nums, nums + N);
	int i = 0, j = N - 1;
	while (i != j)
	{
		if (nums[i] + nums[j] == M)
		{
			break;
		}
		else if(nums[i] + nums[j] > M){
			j--;
		}
		else {
			i++;
		}
	}
	if (i!=j)
	{
		cout << nums[i] << " " << M-nums[i];
	}
	else {
		cout << "No Solution";
	}

	return 0;
}