/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 41ms 640.0 KiB
#3 Accepted 41ms 648.0 KiB
#4 Accepted 43ms 676.0 KiB
#5 Accepted 40ms 648.0 KiB
#6 Accepted 40ms 652.0 KiB
#7 Wrong Answer 41ms 652.0 KiB
#8 Wrong Answer 6ms 328.0 KiB
#9 Wrong Answer 3ms 492.0 KiB
#10 Wrong Answer 37ms 568.0 KiB
#11 Wrong Answer 2ms 332.0 KiB
#12 Wrong Answer 8ms 580.0 KiB
#13 Wrong Answer 20ms 588.0 KiB
#14 Wrong Answer 16ms 588.0 KiB
#15 Wrong Answer 34ms 648.0 KiB

Code

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

string solve(int n, int k, vector<string>& arr) {
    for (int i = 0; i<k && n>1; ++i) {
        int pos = -1;
        string max_con ="";

        for (int j = 0; j < n - 1; ++j) {
            string concat = arr[j] + arr[j + 1];
            if (concat > max_con) {
                max_con = concat;
                pos = j;
            }
        }

        if (pos != -1) {
            arr[pos] = max_con;
            arr.erase(arr.begin() + pos + 1);
            --n;
        }
    }

    return *max_element(arr.begin(), arr.end());
}

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n,k;
        cin>>n>>k;
        vector<string> str(n);

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

        cout << solve(n, k, str) << endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Contest
Bangladesh 2.0
Language
C++17 (G++ 13.2.0)
Submit At
2024-08-16 17:06:32
Judged At
2024-10-03 13:24:07
Judged By
Score
30
Total Time
43ms
Peak Memory
676.0 KiB