/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 588.0 KiB
#2 Accepted 5ms 616.0 KiB
#3 Accepted 5ms 584.0 KiB
#4 Accepted 5ms 584.0 KiB
#5 Accepted 5ms 600.0 KiB
#6 Accepted 5ms 488.0 KiB
#7 Accepted 5ms 624.0 KiB
#8 Accepted 2ms 584.0 KiB
#9 Accepted 2ms 540.0 KiB
#10 Accepted 5ms 616.0 KiB
#11 Accepted 2ms 584.0 KiB
#12 Accepted 4ms 548.0 KiB
#13 Accepted 5ms 460.0 KiB
#14 Accepted 4ms 584.0 KiB
#15 Accepted 5ms 608.0 KiB

Code

#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
#define ll long long
string s[1005];

string maxS(string &a, string &b) {
    if(a.size() > b.size()) return a;
    if(a.size() < b.size()) return b;
    return max(a,b);
}
void solve() {
    int n,k;
    cin >> n >> k;
    for(int i = 0; i < n; i++) {
        cin >> s[i];
    }
    string ans;
    for(int i = 0; i+k < n; i++) {
        string now;
        for(int j = i; j <= i+k; j++)
            now += s[j];
        ans = maxS(ans,now);
    }
    cout << ans << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    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:43:03
Judged At
2024-11-11 03:17:48
Judged By
Score
100
Total Time
5ms
Peak Memory
624.0 KiB