题目描述
样例
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1001];
for (int i = 0; i < n; i++) cin >> a[i];
int p = 0;
for (int i = 1; i < n; i++)
if (a[i] < a[p])//从头到尾找小的
p = i;
printf("Minimum value: %d\n", a[p]);
printf("Position: %d", p);
return 0;
}