蒟蒻的全网最短AC代码

#include <bits/stdc++.h>
int n, a[105], minn = 1e9;
int main()
{
    std::cin >> n;
    for (int i = 1; i <= n; i++){std::cin >> a[i];a[i] *= 100;a[i] += i;}
    std::sort (a + 1, a + n + 1);
    std::cout << a[1] % 100;
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    int n,a[104],min=999,p=0;
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
        if(a[i]<min)
        {
            min=a[i];
            p=i;
        }
    }
    cout << p;
}