#684102 (C++17) No.1630 Sorting Integers (Greater than K)

• 問題: No.1630 Sorting Integers (Greater than K)
• ユーザー: tokusakurai
• 提出日時: 2021-07-30 20:56:14
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 27 ms / 2,000 ms
• コード長: 2,314 bytes
• コンパイル時間: 2,505 ms
• コンパイル使用メモリ: 197,104 KB
• 最終ジャッジ日時: 2025-01-23 10:39:53
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 5
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;
string inc(string S){
    int N = sz(S);
    S[N-1]++;
    rep3(i, N-1, 1){
        int x = S[i]-'0';
        if(x >= 10){
            S[i] -= 10;
            S[i-1]++;
        }
    }
    if(S[0]-'0' >= 10){
        S[0] -= 10;
        S = '1'+S;
    }
    return S;
}
int main(){
    int N; string S; cin >> N >> S;
    //S = inc(S);
    vector<int> c(10);
    rep2(i, 1, 9) cin >> c[i];
    if(sz(S) < N){
        rep2(i, 1, 9){
            rep(j, c[i]) cout << i;
        }
        cout << '\n';
        return 0;
    }
    if(sz(S) > N){
        cout << "-1\n";
        return 0;
    }
    vector<int> d = c;
    int K = -1; //何桁合わせるか
    rep(i, N){
        int x = S[i]-'0';
        bool flag = false;
        rep2(j, x+1, 9){
            if(d[j] > 0) flag = true;
        }
        if(flag) chmax(K, i);
        if(d[x]-- == 0) break;
    }
    if(K == -1){
        cout << "-1\n";
        return 0;
    }
    string ans;
    rep(i, K){
        int x = S[i]-'0';
        ans += S[i];
        c[x]--;
    }
    if(K < N){
        int x = S[K]-'0';
        rep2(j, x+1, 9){
            if(c[j] > 0){
                ans += char('0'+j);
                c[j]--;
                break;
            }
        }
    }
    rep2(i, 1, 9){
        rep(j, c[i]){
            ans += char('0'+i);
        }
    }
    cout << ans << '\n';
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX