1280(2).cpp

杭州电子科技大学ACM-OJ系统的部分代码

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<functional>
using namespace std;
void main()
{  
int t,i,flag1=1,item,k;double n,m;
while( cin>>n>>m)
{   i=0;
    vector<int> coll ;
     vector<int> p;
for(t=0;t<n;t++)
{cin>>item;
coll.push_back(item);}
  k=sqrt(2*m+n)+1;

  sort(coll.begin(),coll.end(),greater<int>());
  vector<int>::iterator pos=coll.begin();
 vector<int>::iterator pos1;
  while(pos!=(coll.begin()+k))
  {  pos1=pos+1;
      while(pos1!=(coll.begin()+k))
      {i=*pos+*pos1;p.push_back(i);pos1++;}pos++;
   }
   sort(p.begin(),p.end(),greater<int>());
   for(t=0;t<m-1;t++)
       cout<<p[t]<<" ";
 cout<<p[t]<<endl;
}
}