google compute test Problem 3题

2019独角兽企业重金招聘Python工程师标准>>>

第三题

#include "stdafx.h"
#include<iostream>
#include<fstream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int A[1001] , B[1001] , C[1001];

int cmp(const int a , const int b){
	return a > b;
}



int main(int argc, char* argv[])
{
//	freopen("D:\\in.txt", "r", stdin);
//	freopen("D:\\out.txt", "w", stdout);

	int m , n;
	cin>>m;
	int i , j;
	for(i = 0 ; i < m ; i ++)
	{
		memset(A,0,sizeof(A));
		memset(B,0,sizeof(B));
		memset(C,0,sizeof(C));
		int odd = 0 , even = 0;
		cin >> n;
		for( j = 0 ; j < n ; j++)
		{
			int temp;
			cin>>temp;
			if(temp % 2 != 0)
			{
				A[odd ++] = temp;
				C[j] = 1;
			}
			else
			{
				B[even ++] = temp;
				C[j] = 0;
			}
		}
		sort(A , A + odd);
		sort(B , B + even,cmp);
		odd = 0;
		even = 0;
		cout<<"Case #"<<i+1<<":";
		for(j = 0 ; j < n ; j ++)
		{
			if(C[j] ==1)
				cout<<" "<<A[odd ++];
			else
				cout<<" "<<B[even ++];

		}
		cout<<endl;
			
	}
	
	
	return 0;
}

转载于:https://my.oschina.net/liangxiao/blog/163505