{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"ds-1000","formal_name":"DS-1000","introduction":"DS-1000 builds 1,000 data-science problems from real StackOverflow questions across seven libraries including NumPy, Pandas and Matplotlib. The problems are perturbed so that recalling the original answer does not solve them.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://ds1000-code-gen.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"51fab69e-77b4-5084-b4a2-06d34cbda2b7","task_key":"default--test--383","task_revision_id":"1","upstream_id":"383","short_description":"I'm sorry in advance if this is a duplicated question, I looked for this…","config":"default","split":"test","body":"{\"library\":\"Numpy\",\"prompt\":\"Problem:\\nI'm sorry in advance if this is a duplicated question, I looked for this information but still couldn't find it.\\nIs it possible to get a numpy array (or python list) filled with the indexes of the N biggest elements in decreasing order?\\nFor instance, the array:\\na = array([4, 1, 0, 8, 5, 2])\\nThe indexes of the biggest elements in decreasing order would give (considering N = 3):\\n8 --> 3\\n5 --> 4\\n4 --> 0\\nresult = [3, 4, 0]\\nThanks in advance!\\nA:\\n<code>\\nimport numpy as np\\na = np.array([4, 1, 0, 8, 5, 2])\\nN = 3\\n</code>\\nresult = ... # put solution in this variable\\nBEGIN SOLUTION\\n<code>\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://ds1000-code-gen.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}