3 10 10 20 20 30 30
20 In this sample, both of them earns $10$ points of happiness by eating Dish $1$, $20$ points by eating Dish $2$, and $30$ points by eating Dish $3$. In this case, since Takahashi and Aoki have the same "taste", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish $3$, then Aoki will choose Dish $2$, and finally Takahashi will choose Dish $1$, so the answer is $(30 + 10) - 20 = 20$.
3 20 10 20 20 20 30
20 In this sample, Takahashi earns $20$ points of happiness by eating any one of the dishes $1, 2$ and $3$, but Aoki earns $10$ points of happiness by eating Dish $1$, $20$ points by eating Dish $2$, and $30$ points by eating Dish $3$. In this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish $3$, then Aoki will choose Dish $2$, and finally Takahashi will choose Dish $1$, so the answer is $(20 + 20) - 20 = 20$.
6 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000
\-2999999997 Note that the answer may not fit into a $32$\-bit integer.
{
"problem": {
"name": "Different Strokes",
"description": {
"content": "There are $N$ dishes of cuisine placed in front of Takahashi and Aoki. For convenience, we call these dishes Dish $1$, Dish $2$, ..., Dish $N$. When Takahashi eats Dish $i$, he earns $A_i$ points of _",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "nikkei2019_qual_c"
},
"statements": [
{
"statement_type": "Markdown",
"content": "There are $N$ dishes of cuisine placed in front of Takahashi and Aoki. For convenience, we call these dishes Dish $1$, Dish $2$, ..., Dish $N$.\nWhen Takahashi eats Dish $i$, he earns $A_i$ points of _...",
"is_translate": false,
"language": "English"
}
]
}