CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
#include<cmath>
using namespace std;

int main()
{
int n;
cin>>n;
int a[n];

for (int i=0;i<n;i++)
{cin>>a[i];}

int maxnum=0,maxcnt=0;
for (int i=0;i<n;i++)
{
int num=1;
for (int j=0;j<n;j++)
{if (a[i]==a[j] && i!=j) num+=1;}

if (num>1|| n==1)
{
if (num>maxcnt){ maxcnt=num; maxnum=a[i];}
}
}
cout<<maxnum<<" "<<maxcnt;

}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int input[n];
	int freq[n];
	for(int i=0;i<n;i++)
	{
		cin>>input[i];
		freq[i]=0;
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
					if(input[i]==input[j])
			{
				freq[j]++;
			}

		}
	}
	int index=0,maxv=0;
	for(int i=0;i<n;i++)
	{
		if(maxv<freq[i])
		{
			index=i;
			maxv=freq[i];
		}
	}
	cout<<input[index]<<" "<<freq[index];

	return 0;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;

int main(){
	int n; cin >> n;
	int a[n];
	int b[n][2];
	for(int i=0; i<n; i++){
		b[i][0] = -1;
		b[i][1] = -1;
	}
		
	for(int i=0; i<n; i++){
		cin >> a[i];
	}
	
	int f = 0;
	for(int i=0; i<n; i++){
		int j = a[i];
		int k = 0;
		for(int m=0; m<n; m++){
			if(b[m][0]>-1){
				if(j == b[m][0]){
					b[m][1]++;
					if(b[m][1] > f) f = b[m][1];
					break;
				}
			}
			else{
				b[m][0] = j;
				b[m][1] = 1;
				if(b[m][1] > f) f = b[m][1];
				break;
			}
		}		
		}

	for(int i=0; i<n; i++){
		if(b[i][1]==f) cout << b[i][0] << " " << f << endl;
	}
	return 0;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;

int main()
{
	int n; cin >> n;
	int arr[n];
	for(int i=0;i<n;i++)
	cin >> arr[i];
	for(int i=0;i<n-1;i++)
	{
		int max_ind=0;
		for(int j=0;j<n-i-1;j++)
		if(arr[max_ind]<arr[j])
		max_ind=j;
		if(arr[max_ind]>arr[n-i-1])
		{
			int temp=arr[max_ind];
			arr[max_ind]=arr[n-i-1];
			arr[n-i-1]=temp;
		}
	}
	int Max=0,c=0,val=arr[0];
	for(int i=0;i<n;i++)
	{
		if(arr[i]==val)
		c++;
		else
		{
			if(c>Max) Max=c;
			val=arr[i];
			c=1;
		}
	}
	if(c>Max)
	cout << arr[n-1] << ' ' << c << '\n';
	else
	for(int i=0;i<n-Max+1;i++)
	if(arr[i]==arr[i+Max-1])
	cout << arr[i] << ' ' << Max << '\n';
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main ()
{
	int n;
	cin >> n;
	int a[n], max = 0, b[n], c[n];
	for(int i = 0; i < n; i++)
	cin >> a[i];

	/*
	for(int i = 0; i < n; i++)
	{
		int p = i;
		for(int j = i; j < n; j++)
		{
			if(a[j] < a[p])
			p = j;
		}

		int t = a[p];
		a[p] = a[i];
		a[i] = t;
	}
	*/

	int l = 0, x = 0, t = 0;
	for(int i = 0; i < n; i++)
	{
		bool f = false;
		for(int j = 0; j < x; j++)
			if(b[j] == a[i])
			{
				f = true;
				break;
			}
		if(f) continue;


		b[x] = a[i];
		c[x] = 0;
		for (int j = i; j < n; j++)
		{
			if(a[j] == b[x])
				c[x]++;
		}
		if(c[x] > max)
			max = c[x];
		x++;

		/*
		if(a[l] != a[i])
		{
			b[x] = a[l];
			c[x] = i-l;
			if(c[x] > max) max = c[x];
			x++;
			l = i;
		}
		*/
	}

	for(int i = 0; i < x; i++)
		if(c[i] == max) 
			cout << b[i] << " " << c[i] << endl;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
void maxn(int a[],int b[],int n,int m)
{
for(int i=0;i<n;i++){if(b[i]==m)cout<<a[i]<<" "<<m<<endl;}
}
int main()
{
int n,m=0;cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++){cin>>a[i];b[i]=1;}
for(int i=1;i<n;i++)
{
for(int j=0;j<i;j++)
{if(a[j]==a[i])b[i]+=1;}
}
for(int i=0;i<n;i++)m=max(m,b[i]);
maxn(a,b,n,m);
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;

int main()
{
int len;
cin>> len;

int arr[len];
int hist[len];//to store the no of times an element occurs
int element[len];//to store the no of UNIQUE elements

for(int i =0; i<len;i++)
{cin >> arr[i];hist[i]= 0;}

int c = 0;

for(int i =0; i<len;i++)
{
int k = arr[i],check = 0;//checks uniqueness of element
for(int j =0; j<c; j++)
{
if(element[j] == k)
{
hist[j]++;
check = 1;
break;
}
}
if(check == 0)
{
element[c] = k;
hist[c++]++;
}
}

//calculating which element occured the max no of times
int max=hist[0], index = 0;
for(int i= 1; i < c; i++)
{
if(hist[i] > max)
index = i;
}

cout<< element[index] << " "<< hist[index];
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#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 s[n];
for(int i=0;i<n;i++)
{	s[i]=0;
}
for(int i=0;i<n;i++)
{	for(int j=i;j<n;j++)
		{if (a[j]==a[i]) s[i]++;}
}
int freq=s[0],p=0;
for(int i=1;i<n;i++)
{	if(s[i]>freq)
	{ freq=s[i];
	 p=i;
	}
}
int l=a[p];
cout<<l<<" "<<freq;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b=0;
int c=0;
for (int i=0;i<n;i++){
cin>>a[i];
}

        for(int j=0;j<n-1;j++){
        for (int k=j+1;k<n;k++){
        if (a[j]=a[j+k]){b++;
        cout<<a[j]<<" "<<b;

}
}

}


return 0;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: C
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#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 max_element = a[0],count = 1;

	for(int i = 0; i<n; i++){
		int c = 1;
		for(int j = 0; j<n; j++){
			if(j != i){
				if(a[j] == a[i]) c++;
			}
		}

		if(c>count){
			count = c;
			max_element = a[i];
		}
	}

	cout<<max_element<<' '<<count;

	
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;

int main(){
    int n;
    cin>>n;
    int a[n],t[n];
    for(int i=0;i<n;i++) {cin>>a[i];t[i]=0;}

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
             if(a[i]==a[j]) t[i]++;}}

    int m=0;
    for(int i=0;i<n;i++){
     if(t[m]<=t[i]) m=i;}
    cout<<a[m]<<" "<<t[m];
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;

int main(){
 
int n;cin>>n;
int ary[n];
for (int i=0;i<n;i++){
	int ele;cin>>ele;
	ary[i]=ele;
	}

for(int i=0;i<n;i++){
	if(ary[i]>0){
		int s=1;
		for (int j=i+1;j<n;j++){
			if(ary[i]==ary[j]){
				s++;
				ary[j]=-1;
				}
			else continue;
			}
		cout<<ary[i]<<" "<<s<<endl;
		}
	else continue;
	
	}}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	if(n==1)
	{
		int a[1];
		cin >> a[0];
		cout << a[0] << " " << 1;
	}
	if(n>1 && n<=20)
	{
	int a[n];
	for(int i=0;i<n;i++) cin >> a[i];

	int b[n];
	for(int i=0;i<n;i++) b[i]=0;

	for(int i=0;i<n-1;i++)
	{
		for(int j=i+1;j<n;j++)
		{

			if(a[i]==a[j]) b[i]++;

		}
	}

	int m=0;
	for(int i=1;i<n;i++)
	{
		if(b[i]>b[m]) m=i;
	}

	cout << a[m] << " " << b[m]+1;
}
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
#include <cmath>
#include<cstdlib>

using namespace std;
int main(){
int a[], 8;
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>endl;
	if (int i, int c=0, a[i]<a[i+1]);
	   a[i]=c;
       a[i+1]=a[i];
       c=a[i+1];
       return;
	if (int a[], a[0]=a[1] && a[2]=a[0] && a[0]=a[3] && a[0]=a[4] && a[0]=a[5] && a[0]=a[6] && a[0]=a[7]);
	cout<< a[0] << "8" << endl;
	return 0;
    if (int a[], a[0]=a[1] && a[2]=a[0] && a[0]=a[3] && a[0]=a[4] && a[0]=a[5] && a[0]=a[6]);
    cout<< a[0] << "7" << endl;
	   return 0;
    if (int a[], a[0]=a[1] && a[2]=a[0] && a[0]=a[3] && a[0]=a[4] && a[0]=a[5] );
    cout<< a[0] << "6" << endl;
	   return 0;
    if (int a[], a[0]=a[1] && a[2]=a[0] && a[0]=a[3] && a[0]=a[4]);
	cout<< a[0] << "5" << endl;
	   return 0;
    if (int a[], a[0]=a[1] && a[2]=a[0] && a[0]=a[3]);
	cout<< a[0] << "4" << endl;
	   return 0;
    if (int a[], a[0]=a[1] && a[2]=a[0]);
	cout<< a[0] << "3" << endl;
	   return 0;
    if (int a[], a[0]=a[1]);
	cout<< a[0] << "2" << endl;
	   return 0;
    else;
	cout<< "1";
	   return 0;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: C
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int f(int *A,int l,int n){
int p=0;
for (int i=0;i<n;i++) {
if (A[i]==A[l]) {
p=p+1;}}
return p;}
int argmax(int *arr,int p){
int max=0;
for (int j=0;j<p;j++){
if (arr[max]<arr[j]) max=j;}
return max;}
int main(){
int n;cin>>n;
int A[n];int arr[n];
for (int i=0;i<n;i++) {
cin>>A[i];
}
for (int i=0;i<n;i++) {
arr[i]=f(A,i,n);
} 
int u=arr[argmax(arr,n)];
int z=A[argmax(arr,n)];
cout<<z<<" "<<u;
}

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<bits/stdc++.h>
using namespace std;

int max(int b[],int n);
int main()
{

int n,i,j,maxin,K;
cin>>n;

int x[n];
for(K=0;K<n;K++)
{
cin>>x[K];

}

bool flag;
int a[n];
for(i=0;i<n;i++)
{a[i]=0;}

for(i=0;i<n;i++)
{
	for(j=1;j<=i;j++)
	{
		if((i-j)>=0)
		{
			if(x[i]!=x[i-j])
			flag=1;
			else
			{flag=0;
			break;}
		}
	if(flag)
	{
		for(j=0;j<n-i;j++)
		{
			if(x[i]==x[i+j])
			a[i]=a[i]+1;
		}
	}	
	}
}

maxin=max(a,n);
cout<<x[maxin]<<" "<<a[maxin];
}

int max(int b[],int n)
 {
 	int i,maxin=0;
 	for(i=1;i<n;i++)
 	{if(b[maxin]<b[i])
 	maxin=i;}
 	return maxin;
 }

Grading criterion: Space Complexity
Rating A: Done in O(1) space
Rating B: Done in O(n) space
Rating C: Anything worse or wrong
Rating D: 0
Assigned grade: B