35 lines
678 B
C++
Raw Normal View History

2025-01-29 09:18:27 +01:00
#include <iostream>
#include <conio.h>
using namespace std;
int main() {
int a[] = {5,18,7,9,2,1,11,8,2,3};
int i,k,max1,max2,n;
n = sizeof(a)/sizeof(a[0]);
max1 = a[0];
k = 0;
for(i=1; i<n; i++) {
if(a[i] > max1) {
max1 = a[i];
k = i;
}
}
cout << "Najwiekszy element: " << max1 << endl;
cout << "Indeks najwiekszego elementu: " << k << endl;
2025-01-29 09:23:04 +01:00
if(k == 0) max2 = a[1];
else max2 = a[0];
2025-01-29 09:18:27 +01:00
for(i=1; i<n; i++) {
if(i!=k && a[i] > max2) {
max2 = a[i];
}
}
cout << "Drugi najwiekszy element: " << max2 << endl;
system("pause");
return 0;
}