c_cpp 找到未排序数组中最大的对总和

Posted 2021-05-14

// https://www.geeksforgeeks.org/find-the-largest-pair-sum-in-an-unsorted-array/
#include <iostream>
using namespace std;

int main(){
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++)
        cin>>a[i];
    int max1=INT_MIN, max2=INT_MIN,i=0;
    if (a[i] < a[i+1]){
        max2=a[i];
        max1=a[i+1];
    }
    else {
        max1=a[i];
        max2=a[i+1];
    }
    i++;
    while(i<n){
        if (a[i] > max1) {
            max2 = max1;
            max1 = a[i];
        }
        else if (a[i] > max2 && a[i] < max1)
            max2 = a[i];
        i++;
    }
    cout<< "Sum is: "<< max1+max2;
}