/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 7ms 588.0 KiB
#3 Accepted 6ms 584.0 KiB
#4 Accepted 7ms 588.0 KiB
#5 Accepted 5ms 580.0 KiB
#6 Accepted 5ms 592.0 KiB
#7 Wrong Answer 5ms 580.0 KiB
#8 Wrong Answer 3ms 328.0 KiB

Code

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N, K;
        cin >> N >> K;
        vector<string> arr(N);
        for (int i = 0; i < N; i++) {
            cin >> arr[i];
        }

        string maxNumber = "";
        for (int i = 0; i < N - K; i++) {
            string current = "";
            for (int j = i; j <= i + K; j++) {
                current += arr[j];
            }
            if (current > maxNumber) {
                maxNumber = current;
            }
        }

        cout << maxNumber << 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:04:55
Judged At
2024-11-11 03:12:47
Judged By
Score
30
Total Time
7ms
Peak Memory
592.0 KiB