Sample Input
1
4
9999998
1
2
9999999
Sample Output
yes 1 9999999
AC代码:
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 1000100
//author:XXYY
int L[MAX];
int main(){
int X,n,l,r,flag,i;
while(~scanf("%d",&X)){
X*=10000000;
scanf("%d",&n);
flag=0;
for(i=0;i<n;i++)
scanf("%d",&L[i]);
if(!n||n==1){
printf("danger\n");
continue;
}
sort(L,L+n);
l=0;
r=n-1;
while(l<r){
if(L[l]+L[r]==X){
flag=1;
printf("yes %d %d\n",L[l],L[r]);
break;
}
else if(L[l]+L[r]<X)
l++;
else
r--;
}
if(!flag)
printf("danger\n");
}
return 0;
}