PAT（甲级）1048. Find Coins (25)

题目：https://www.patest.cn/contests/pat-a-practise/1048

代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
	int a[1005]={0};
	int i,j,temp;  
  int n,m;  
  scanf("%d%d",&n,&m);  
  for (i=0;i<n;i++)  
    {  
      scanf("%d",&temp);  
      a[temp]++;   
    }  
  for (i=1;i<=m-i;i++) 
    {  
      a[i]--;a[m-i]--;  
      if (a[i]>=0&&a[m-i]>=0)  
          break;  
    }  
  if (i<=m-i)  
    printf("%d %d\n",i,m-i);  
  else   
    printf("No Solution\n");  
  return 0;  
	
}