#include <iostream>
#include <algorithm>
using namespace std;
 
int main() {
    const size_t size = 7;
	int array[size] = { 70, 20, 60, 40, 10, 30, 40 };
    std::sort(&array[0], &array[size]);
 
	for (size_t i = 0; i < size; ++i)
        std::cout << array[i] << " ";
    std::cout << endl;
 
    // lowest:
    std::cout << "Lowest: " << array[0] << std::endl;
 
    // duplicate check
    // skip 1 and use backwards-looking checks, this saves us having
    // to do math in the loop condition.
    for (size_t i = 1; i < size; ++i) {
        if (array[i] == array[i - 1])
            std::cout << (i - 1) << " and " << i << " both contain " << array[i] << std::endl;
    }
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBjb25zdCBzaXplX3Qgc2l6ZSA9IDc7CglpbnQgYXJyYXlbc2l6ZV0gPSB7IDcwLCAyMCwgNjAsIDQwLCAxMCwgMzAsIDQwIH07CiAgICBzdGQ6OnNvcnQoJmFycmF5WzBdLCAmYXJyYXlbc2l6ZV0pOwoKCWZvciAoc2l6ZV90IGkgPSAwOyBpIDwgc2l6ZTsgKytpKQogICAgICAgIHN0ZDo6Y291dCA8PCBhcnJheVtpXSA8PCAiICI7CiAgICBzdGQ6OmNvdXQgPDwgZW5kbDsKCiAgICAvLyBsb3dlc3Q6CiAgICBzdGQ6OmNvdXQgPDwgIkxvd2VzdDogIiA8PCBhcnJheVswXSA8PCBzdGQ6OmVuZGw7CgogICAgLy8gZHVwbGljYXRlIGNoZWNrCiAgICAvLyBza2lwIDEgYW5kIHVzZSBiYWNrd2FyZHMtbG9va2luZyBjaGVja3MsIHRoaXMgc2F2ZXMgdXMgaGF2aW5nCiAgICAvLyB0byBkbyBtYXRoIGluIHRoZSBsb29wIGNvbmRpdGlvbi4KICAgIGZvciAoc2l6ZV90IGkgPSAxOyBpIDwgc2l6ZTsgKytpKSB7CiAgICAgICAgaWYgKGFycmF5W2ldID09IGFycmF5W2kgLSAxXSkKICAgICAgICAgICAgc3RkOjpjb3V0IDw8IChpIC0gMSkgPDwgIiBhbmQgIiA8PCBpIDw8ICIgYm90aCBjb250YWluICIgPDwgYXJyYXlbaV0gPDwgc3RkOjplbmRsOwogICAgfQoJcmV0dXJuIDA7Cn0=