1280.cpp

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

#include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
#include<list>
using namespace std;
int main()
{
	
	int n,m;
	while(cin>>n>>m)
	{
		vector<int> A(3000);
        list<int> L;
        if(n<=0||m<=0)
		{ exit(0);}
		else
		{
			for(int i=0;i<n;i++)
				cin>>A[i];






/*
#include<iostream>
#include<algorithm>
#include<functional>
#include<list>
using namespace std;
int main()
{
	int n,m, t,item;
	while(cin>>n>>m)
	{
		list<int> L1;
	    list<int> L2;
		t=n*(n-1)/2;
		if(n<=0||m<=0)
		{ exit(0);}
		else
		{
			for(int i=0;i<n;i++)
			{
				cin>>item;
				L1.push_front(item);
			}
			list<int>::iterator q=L1.begin(),p=L1.begin();
			ostream_iterator<int> output( cout," ");  
            q++;                                              //实现相邻2数相加
			while(q!=L1.end())
			{
	
				L2.push_front((*q)+(*p));
				p++;
				q++;
			}
            L2.sort(greater<int>());
			p=L2.begin();
			for(i=0;i<m-1;i++)
			{
				cout<<*p<<" ";
				p++;
			}
			cout<<*p<<endl;
		}
	}
	return 0;
}
*/