一开始看错题目,以为是可以排列的。
1.#include<algorithm>
#include <iterator>
#include<cstdio>
#include<set>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<math.h>
#include<stack>
#include<iostream>
#include<sstream>
#include<queue>
#include<cassert>
const int maxn=6000;
using namespace std;
deque<int>q,acle[8];
int a[25];
int main()
{//freopen("input.txt","r",stdin);
int mycount=0;
int n;
int k=0;
while(cin>>n)
{int count=0;
long long finalsum=0;
mycount++;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
if(k!=0)
{
cout<<"\n";
}
sort(a,a+n);
int negative_count=0;
int tranform_positvevalues=-1;
int tranform_negativevalues=-1;
int acount=0;
for(int i=0;i<n;i++)
{
if(i+1<n)
{if(a[i]*a[i+1]<=0&