Submission #73392189

---

Source Code Expand

#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <queue>
#include <stack>
#include <random>
#include <chrono>
#include <map>
#include <set>
#include <ctime>
#include <bitset>
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;

#define lp p << 1
#define rp p << 1 | 1
#define lowbit(x) (x & (-x))
#define i128 __int128
#define ent "\n"
#define cc(x) cout << fixed << setprecision(x)

const int mod = 1e9 + 7;
const double eps = 1e-8;
const int oo = 0x3f3f3f3f;
const LL INF = 2e18;

void solve() {
    // auto seed = std::chrono::system_clock::now().time_since_epoch().count();
    // mt19937_64 gen(seed);  
    // uniform_int_distribution<LL> dist(1, 1e18);

    // freopen("114514.in", "r", stdin);
    // freopen("114514.out", "w", stdout);
    
    /*   /\_/\
    *   (= ._.)
    *   / >  \>
    */

    int n, k; cin >> n >> k;
    int pos = 1, mx = -oo;
    for (int i = 1; i <= n; ++ i) {
        int x; cin >> x;
        if (x > mx) {
            mx = x;
            pos = i;
        }
    }
    cout << pos << ent;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int T = 1;
    bool flag = 0;
    if (flag) cin >> T;
    while (T --) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result