// sort algorithm example
#include <iostream>
#include <algorithm>
using namespace std;
bool compare(int a, int b) {
return (a > b);
}
int main () {
int x[] = {2, 4, 1, 7, 8, 0, 9};
sort(x, x + sizeof(x) / sizeof(int), compare);
for (int y: x) cout << ' ' << y;
}
Ly8gc29ydCBhbGdvcml0aG0gZXhhbXBsZQojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBjb21wYXJlKGludCBhLCBpbnQgYikgewoJcmV0dXJuIChhID4gYik7IAp9CgppbnQgbWFpbiAoKSB7CglpbnQgeFtdID0gezIsIDQsIDEsIDcsIDgsIDAsIDl9OwoJc29ydCh4LCB4ICsgc2l6ZW9mKHgpIC8gc2l6ZW9mKGludCksIGNvbXBhcmUpOwoJZm9yIChpbnQgeTogeCkgY291dCA8PCAnICcgPDwgeTsKfQ==