0分,求救
查看原帖
0分,求救
1200401
wnqnld_llx楼主2024/3/1 21:09
#include<bits/stdc++.h>
using namespace std;
struct pop{
	string name;
	char pai;
	int num;
	bool panduan;
};
int main(){
	int n,m;
	cin>>n>>m;
	pop a[n+m];
	for(int i=0;i<n+m;i++){
		cin>>a[i].name>>a[i].pai>>a[i].num;
		a[i].panduan=1;
	}
	int bans=0,banh=0;
	while(bans!=5&&banh!=2){
		int maxs=0,maxh=0;
		for(int i=0;i<m+n;i++){
			if(bans<5&&a[i].num>maxs&&a[i].pai=='S'&&a[i].panduan==1){
				maxs=a[i].num;
				a[i].panduan=0;
				bans++;
			}
			if(banh<2&&a[i].num>maxh&&a[i].pai=='H'&&a[i].panduan==1){
				maxh=a[i].num;
				a[i].panduan=0;
				banh++;
			}
		}
	}
	int picks=0,pickh=0,u;
	int lll[4],ppp=0;
	while(picks<4&&pickh<1){
		int maxs=0,maxh=0;
		for(int i=0;i<m+n;i++){
			if(picks<4&&a[i].num>maxs&&a[i].pai=='S'&&a[i].panduan==1){
				maxs=a[i].num;
				a[i].panduan=0;
				picks++;
			}
			if(pickh<1&&a[i].num>maxh&&a[i].pai=='H'&&a[i].panduan==1){
				maxh=a[i].num;
				a[i].panduan=0;
				pickh++;
			}
		}
		u=maxh;
		lll[ppp]=maxs;
		ppp++;
	}
	cout<<u<<endl;
	sort(lll,lll+4);
	for(int i=3;i>=0;i--) cout<<lll[i]<<endl; 
}
2024/3/1 21:09
加载中...