/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 320.0 KiB
#2 Wrong Answer 3ms 572.0 KiB
#3 Wrong Answer 3ms 764.0 KiB
#4 Wrong Answer 3ms 496.0 KiB
#5 Wrong Answer 3ms 592.0 KiB
#6 Wrong Answer 3ms 576.0 KiB
#7 Wrong Answer 3ms 580.0 KiB
#8 Wrong Answer 2ms 320.0 KiB
#9 Wrong Answer 2ms 324.0 KiB
#10 Wrong Answer 3ms 568.0 KiB
#11 Wrong Answer 2ms 320.0 KiB
#12 Wrong Answer 2ms 440.0 KiB
#13 Wrong Answer 3ms 320.0 KiB
#14 Wrong Answer 2ms 532.0 KiB
#15 Wrong Answer 3ms 532.0 KiB

Code

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

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

    while (T--) {
        int N, K;
        cin >> N >> K;

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

        sort(numbers.begin(), numbers.end(), [](const string& a, const string& b) {
            return a.length() > b.length() || (a.length() == b.length() && a > b);
        });

        for (int i = 0; i < K; i++) {
            numbers[i] += numbers[i + 1];
            numbers.erase(numbers.begin() + i + 1);
        }

        cout << numbers[0] << endl;
    }

    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 17:03:02
Judged At
2024-10-03 13:24:29
Judged By
Score
0
Total Time
3ms
Peak Memory
764.0 KiB