#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int a [N] , n , m;
signed main(){
	    cin >> n;
	    for (int i = 1; i <= n; i++)
	    {
	    	scanf ("%d" , &a[i]);
		}
		cin >> m;
	    sort(a + 1 , a + 1 + n);
	    int l = 1 , r = n;
	    while(l <= r)
		{
		    if(a [l] + a [r] == m)
			{
			    cout << a [l] << " " << a [r];
			    return 0;
		    }
		    else
			{
			    if(a[l] + a[r] < m)
				{
				   l++;
			    }
			    else
				{
				   r--;
			    }
		}
	}
	cout << "No";
	return 0;
}

虽然只有一种味，但真的很 鲜~

向日葵味

#include<bits/stdc++.h>
using namespace std;
int a[100010];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a,a+n);
	int m;
	cin>>m;
	for(int i=0;i<n;i++)
	{
		int l=0,r=n;
		int t=m-a[i];
		while(l<r) 
		{
			int mid=(l+r)>>1;
			if(a[mid]>=t) r=mid;
			else l=mid+1;
		}
		if(t==a[r]&&r!=i)
		{
			cout<<a[i]<<' '<<a[r]<<endl;
			return 0;
		}
	}
	cout<<"No"<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long a[1000005]={0};
int main(){
	int n,m;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	cin>>m;//和为m
	sort(a+1,a+n+1);
	int l=1,r=n;//双指针 
	while(l<=r){
		if(a[l]+a[r]==m){
			cout<<a[l]<<" "<<a[r];
			return 0;
		}
		else if(a[l]+a[r]>m){
			r--;
		}
		else{
			l++; 
		} 	
	}
	cout<<"No";
	return 0;
}
小鸟