Expecting your tips&hints

[binf]

I want to write a code where will be given n integer numbers.The program will print the two numbers whose difference is the closest.It will show any two, if there are many numbers giving the same minimum difference.
I wrote a code but I don't get the desired result.Would you give me some help? :)

  #include <iostream>
using namespace std;

int main ()
{
    int n,max,num,difference;
    cin >> n >> max;
    for (int i=1;i<=n-1;i++)
    {
        cin >> num;
        if (num>max) {max=num;
        difference=num-max;
    }
    cout << max << " " << num << " " << difference;
    return 0;
}
}

[keskiverto]

You have to store those n numbers. I would put them into std::vector.

Sort the numbers. See http://www.cplusplus.com/reference/algorithm/sort/

Calculate adjacent differences. See http://www.cplusplus.com/reference/numeric/adjacent_difference/

Find minimum difference. See http://www.cplusplus.com/reference/algorithm/min_element/

Show corresponding values. See http://www.cplusplus.com/reference/iterator/distance/

[ne555]

Learn to indent

#include <iostream>
using namespace std;

int main ()
{
	int n,max,num,difference;
	cin >> n >> max;
	for (int i=1;i<=n-1;i++)
	{
		cin >> num;
		if (num>max) {
			max=num;
			difference=num-max; //num - num == 0
		}
		cout << max << " " << num << " " << difference;
		return 0;
	}
}

you'll read two numbers and your program would terminate.

Also explain what you are trying to do in that if block.

[binf]

this code doesn't give the right output.. :/

[ne555]

that was your code, I just indent it properly.