zoukankan      html  css  js  c++  java
  • [暴力] [HPU] 最大数

    只有两种情况

    一种 blen > alen

    排递减序输出

    另一种blen == alen

    排递增序

    从第一位开始逐个试可填最大值

    最后保留至即为最大值

    #pragma GCC optimize(2)
    #include <cstdio>
    #include <iostream>
    #include <cstdlib>
    #include <cmath>
    #include <cctype>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <stack>
    #include <queue>
    #include <set>
    #include <map>
    #include <ctime>
    #include <vector>
    #include <fstream>
    #include <list>
    #include <iomanip>
    #include <numeric>
    using namespace std;
    typedef long long ll;
    
    const int MAXN = 1e6 + 10;
    
    bool cmp(char a, char b)
    {
        return a > b;
    }
    
    int main()
    {
        ios::sync_with_stdio(false);
    
        cin.tie(0);     cout.tie(0);
    
        int N;
    
        cin>>N;
        
        while(N--)
        {
            string a, b, t, ans;
    
            cin>>a>>b;
    
            if(b.length() > a.length())
            {
                sort(a.begin(), a.end(), cmp);
    
                cout<<a<<endl;
            }
            else
            {
                sort(a.begin(), a.end());
                
                t = a;
    
                for(int i = 0; i < a.length(); i++)
                {
                    a = t;
                    
                    for(int j = i + 1; j < a.length(); j++)
                    {
                        swap(a[i], a[j]);
                        
                        if(a <= b)
                            t = a;
                    }
    
                }
                cout<<a<<endl;
            }
        }
    
        return 0;
    }
  • 相关阅读:
    SpringBoot整合阿里云OSS
    UVALive
    HDU 5794 A Simple Chess dp+Lucas
    数论
    UVALive
    UVALive
    HDU 5792 World is Exploding 树状数组+枚举
    UVALive
    UVALive
    UVALive
  • 原文地址:https://www.cnblogs.com/zeolim/p/12270483.html
Copyright © 2011-2022 走看看