[蓝桥杯练习题]查找两个总和为特定值的索引

#include<bits/stdc++.h>
using namespace std;
int n;
int tar;
int mini=INT_MAX;
int ans_a,ans_b;
void backtracking(int startindex,int arr[]){
	for(int i=startindex+1;i<n;++i){
		int sum=arr[startindex]+arr[i];
		if(tar==sum&&(startindex+i)<mini){
			mini=startindex+i;
			ans_a=startindex;
			ans_b=i;
		}
	}
}
int main(){
	ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
	cin>>n;int arr[n];for(int i=0;i<n;++i)cin>>arr[i];cin>>tar;
	for(int i=0;i<n;++i)backtracking(i,arr);
	cout<<min(ans_a,ans_b)<<" "<<max(ans_a,ans_b);
	return 0;
}