Submission #72343662

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n;
struct node{
	int t,id;
}a[N];
inline bool cmp(node a,node b){
	return a.t<b.t;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].t;
		a[i].id=i;
	}
	sort(a+1,a+n+1,cmp);
	cout<<a[1].id<<' '<<a[2].id<<' '<<a[3].id;
	return 0;
}

Submission Info

Submission Time
Task B - Trifecta
User kac17
Language C++23 (GCC 15.2.0)
Score 200
Code Size 383 Byte
Status AC
Exec Time 1 ms
Memory 3668 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 random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
random_01.txt AC 1 ms 3432 KiB
random_02.txt AC 1 ms 3432 KiB
random_03.txt AC 1 ms 3544 KiB
random_04.txt AC 1 ms 3548 KiB
random_05.txt AC 1 ms 3524 KiB
random_06.txt AC 1 ms 3548 KiB
random_07.txt AC 1 ms 3476 KiB
random_08.txt AC 1 ms 3668 KiB
sample_01.txt AC 1 ms 3544 KiB
sample_02.txt AC 1 ms 3548 KiB