Submission #1332159

#TimeUsernameProblemLanguageResultExecution timeMemory
1332159neptunnsKrugomet (COCI25_krugomet)C++20
13 / 70
11 ms1960 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int long long
#define maxn 1005
#define mi LLONG_MIN
#define ma LLONG_MAX
#define mod 1000000007
#define pb push_back
#define S second
#define F first

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    int ans = 0;
    int idx = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        if(ans < a[i]){
            ans = a[i];
            idx = i;
        }
    }
    vector<int> s(n);
    for (int i = 0; i < n; i++)
    {
        cin >> s[i];
    }
    cout << ans << endl << (idx + (k % n)) % n + 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...