Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void nhap(int *a,int n)
- {
- for (int i=0;i<n;i++)
- cin>>a[i];
- }
- int min(int *a,int n)
- {
- int min=a[0];
- for (int i=1;i<n;i++)
- {
- if (a[i]<= min)
- min=a[i];
- }
- return min;
- }
- int timSoLonNhat(int *A, int n) {
- int soLonNhat = min(A,n);
- int index;
- for (int i = 0; i < n; i++) {
- if (A[i] > soLonNhat) {
- soLonNhat = A[i];
- index = i;
- }
- }
- A[index] = min(A,n);
- return soLonNhat;
- }
- void tim3SoLonNhat(int *&A, int n) {
- int ith = 1;
- while (ith <= 3) {
- cout<<timSoLonNhat(A, n)<<" ";
- ith++;
- };
- }
- int main() {
- int *A;
- int n = 7;
- A = new int[n]; // Cấp phát bộ nhớ
- A[0] = 86;
- A[1] = 48;
- A[2] = 57;
- A[3] = 14;
- A[4] = 57;
- A[5] = 37;
- A[6] = 78;
- cout<<("3 so co tich lon nhat la: \n");
- tim3SoLonNhat(A, n);
- delete[]A;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement