Submission #24855645

Source Code Expand

#include <bits/stdc++.h>
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("tune=native")*/
using namespace std;
typedef long long ll;
typedef long double ld;

const int MAX_N = 200005;

int n;
pair<int, int> a[MAX_N];

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

	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a, a + n, greater<pair<int, int>>());
	cout << (a[1].second + 1) << '\n';

	return 0;
}

Submission Info

Submission Time
Task B - Booby Prize
User artsin6
Language C++ (GCC 9.2.1)
Score 200
Code Size 539 Byte
Status AC
Exec Time 41 ms
Memory 5172 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, random_01.txt, random_02.txt, random_03.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 3 ms 3476 KiB
hand_02.txt AC 2 ms 3608 KiB
hand_03.txt AC 2 ms 3584 KiB
hand_04.txt AC 3 ms 3576 KiB
hand_05.txt AC 2 ms 3480 KiB
random_01.txt AC 41 ms 5088 KiB
random_02.txt AC 35 ms 5100 KiB
random_03.txt AC 41 ms 5172 KiB
sample_01.txt AC 2 ms 3616 KiB
sample_02.txt AC 2 ms 3588 KiB