#include <iostream>
#include <vector>
using namespace std;
 
int main() {
 
	int arr1[]={2,3,4,5};
    int arr2[]={5,6,7,8};
    vector<int> v;
    int n= sizeof(arr1)/sizeof(arr1[0]);
    for(int i =0 ; i <n ;i++){
    	int pairsum = arr1[i]+arr2[i];
    	v.push_back(pairsum);
    }
    int largest = 0 ;
    for(int i =0 ; i < v.size(); i++){
    	if(v[i]>largest){
    		largest = v[i];
    	}
    }
    cout <<"Maximum sum pair: "<< largest<<endl;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkKCWludCBhcnIxW109ezIsMyw0LDV9OwogICAgaW50IGFycjJbXT17NSw2LDcsOH07CiAgICB2ZWN0b3I8aW50PiB2OwogICAgaW50IG49IHNpemVvZihhcnIxKS9zaXplb2YoYXJyMVswXSk7CiAgICBmb3IoaW50IGkgPTAgOyBpIDxuIDtpKyspewogICAgCWludCBwYWlyc3VtID0gYXJyMVtpXSthcnIyW2ldOwogICAgCXYucHVzaF9iYWNrKHBhaXJzdW0pOwogICAgfQogICAgaW50IGxhcmdlc3QgPSAwIDsKICAgIGZvcihpbnQgaSA9MCA7IGkgPCB2LnNpemUoKTsgaSsrKXsKICAgIAlpZih2W2ldPmxhcmdlc3QpewogICAgCQlsYXJnZXN0ID0gdltpXTsKICAgIAl9CiAgICB9CiAgICBjb3V0IDw8Ik1heGltdW0gc3VtIHBhaXI6ICI8PCBsYXJnZXN0PDxlbmRsOwoJcmV0dXJuIDA7Cn0=