1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | #include <list> template <typename T> bool lessThanInAnyOrder(T lhs, T rhs) { return lhs < rhs; } template <typename T> bool lessThanInAnyOrder(std::list<T> lhs, std::list<T> rhs) { bool (*comparer)(T, T) = &lessThanInAnyOrder<T>; lhs.sort(comparer); rhs.sort(comparer); //Do comparisons here, but for now just: return false; } int main() { std::list<int> list1; std::list<int> list2; lessThanInAnyOrder(list1, list2); } |
I2luY2x1ZGUgPGxpc3Q+Cgp0ZW1wbGF0ZSA8dHlwZW5hbWUgVD4KYm9vbCBsZXNzVGhhbkluQW55T3JkZXIoVCBsaHMsIFQgcmhzKQp7CiAgcmV0dXJuIGxocyA8IHJoczsKfQoKdGVtcGxhdGUgPHR5cGVuYW1lIFQ+CmJvb2wgbGVzc1RoYW5JbkFueU9yZGVyKHN0ZDo6bGlzdDxUPiBsaHMsIHN0ZDo6bGlzdDxUPiByaHMpCnsKICBib29sICgqY29tcGFyZXIpKFQsIFQpID0gJmxlc3NUaGFuSW5BbnlPcmRlcjxUPjsKICBsaHMuc29ydChjb21wYXJlcik7CiAgcmhzLnNvcnQoY29tcGFyZXIpOwoKICAvL0RvIGNvbXBhcmlzb25zIGhlcmUsIGJ1dCBmb3Igbm93IGp1c3Q6CiAgcmV0dXJuIGZhbHNlOwp9CgppbnQgbWFpbigpCnsKICBzdGQ6Omxpc3Q8aW50PiBsaXN0MTsKICBzdGQ6Omxpc3Q8aW50PiBsaXN0MjsKICBsZXNzVGhhbkluQW55T3JkZXIobGlzdDEsIGxpc3QyKTsKfQ==
-
upload with new input
-
result: Success time: 0s memory: 2720 kB returned value: 0


