/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 18ms 576.0 KiB
#3 Accepted 17ms 580.0 KiB
#4 Accepted 18ms 704.0 KiB
#5 Accepted 18ms 624.0 KiB
#6 Accepted 18ms 668.0 KiB
#7 Wrong Answer 18ms 676.0 KiB
#8 Wrong Answer 3ms 572.0 KiB
#9 Wrong Answer 2ms 324.0 KiB
#10 Wrong Answer 17ms 628.0 KiB
#11 Wrong Answer 2ms 532.0 KiB
#12 Wrong Answer 5ms 580.0 KiB
#13 Wrong Answer 13ms 592.0 KiB
#14 Wrong Answer 10ms 588.0 KiB
#15 Wrong Answer 15ms 580.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;

    while (t--) {
        int n, k;
        cin >> n >> k;

        vector<string> vl(n);
        for (int i = 0; i < n; ++i) {
            cin >> vl[i];
        }

        for (int j = 0; j < k && n > 1; j++) {
            int idx = 0;
            string best = vl[0] + vl[1];

            for (int i = 1; i < n - 1; i++) {
                string cnt= vl[i] + vl[i + 1];
                if (cnt > best) {
                    best= cnt;
                    idx = i;
                }
            }

            vl[idx] = best;
            vl.erase(vl.begin() + idx + 1);
            --n;
        }

        string mx= vl[0];
        for (int i = 1; i < n; i++) {
            if (vl[i] > mx) {
                mx= vl[i];
            }
        }

        cout << mx<< "\n";
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 15:55:39
Judged At
2024-10-03 13:29:28
Judged By
Score
30
Total Time
18ms
Peak Memory
704.0 KiB