全RE求助!!
查看原帖
全RE求助!!
977778
__Harry_Haiyun__楼主2023/7/20 17:37
#include <bits/stdc++.h>
#define MOD 998244353
#define mod 1000000007
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define range(i,a,b) for (int i = a; i <= b; i++)
#define round(i,a,b) for (int i = a; i < b; i++)
#define rrange(i,a,b) for (int i = a; i >= b; i--)
#define rround(i,a,b) for (int i = a; i > b; i--)
using namespace std; 
int main()
{
	ll n,m,i,s = 0,h = 0,j;
	cin >> n >> m;
	string name_s[n];
	string name_h[m];
	string NULl;
	ll care_s[n];
	ll care_h[m];
	ll NuLL;
	char Null;
	range(i,1,n + m)
	{
	    cin >> NULl >> Null >> NuLL;
	    if (Null == 'S')
	    {
	        name_s[i] = NULl;
	        care_s[i] = NuLL;
        }
        if (Null == 'H')
        {
            name_h[i] = NULl;
            care_h[i] = NuLL;
        }
    }
    round(i,0,n - 1)
    {
        round(j,0,n - 1)
        {
            if (care_h[j] < care_h[j + 1]) 
            {
                swap(care_h[j],care_h[j + 1]);
                swap(name_h[j],name_h[j + 1]);
            }
        }
    }
    cout << name_h[2] << endl;
    round(i,0,n - 1)
    {
        round(j,0,n - 1)
        {
            if (care_s[j] < care_s[j + 1]) 
            {
                swap(care_s[j],care_s[j + 1]);
                swap(name_s[j],name_s[j + 1]);
            }
        }
    }
    range(i,5,8) cout << name_s[i] << endl;
   	return 0;
}
2023/7/20 17:37
加载中...