这个真的超级有用!
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
int numrecord[100];
int n,m;
while(scanf("%d",&n) != EOF){
for(int i = 0;i <n;i++){
scanf("%d",&numrecord[i]);
}
scanf("%d",&m);
//如果是乱序,先排个序
sort(numrecord,numrecord+n);
//i,j的初始值
int i = 0;
int j = n - 1;
//这种思路太棒了
while(i <j){
if(numrecord[i] + numrecord[j] == m){
printf("%d %d\n",numrecord[i],numrecord[j]);
i++;
j--;
}
else if(numrecord[i] + numrecord[j]<m){
i++;
}
else{
j--;
}
}
memset(numrecord,0,sizeof(numrecord));
}
return 0;
}