/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Wrong Answer 2ms 588.0 KiB
#3 Wrong Answer 2ms 488.0 KiB
#4 Wrong Answer 2ms 516.0 KiB
#5 Wrong Answer 2ms 492.0 KiB
#6 Wrong Answer 3ms 556.0 KiB
#7 Wrong Answer 2ms 588.0 KiB
#8 Wrong Answer 2ms 440.0 KiB
#9 Wrong Answer 2ms 772.0 KiB
#10 Wrong Answer 2ms 540.0 KiB
#11 Wrong Answer 2ms 328.0 KiB
#12 Wrong Answer 2ms 584.0 KiB
#13 Wrong Answer 2ms 600.0 KiB
#14 Wrong Answer 2ms 600.0 KiB
#15 Wrong Answer 2ms 676.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl '\n'



void solve()
{
    
    int n , k ; cin>> n >> k ;
    string aa[n+5];
    for(int i=1 ; i<=n ; i++){
        string x ; cin>> x ;
        aa[i] = x ;
    }
    set<string> ss ;
    
    for(int i=1 ; i<=n-k ; i++){
        string nt ="" ;
        for(int j=i ; j<=i+2 ; j++){
            nt += aa[j];
        }
        //cout<< nt << nl;
        ss.insert(nt);
    }
    
    auto it = ss.end();
    it--;
    cout<< *it << nl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int T ;
    cin >> T ;
    for (int tt = 1 ; tt <= T ; tt++)
    {
        solve() ;
    }
}

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:59:13
Judged At
2024-10-03 13:29:13
Judged By
Score
5
Total Time
3ms
Peak Memory
772.0 KiB