Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define mp make_pair
- #define pb push_back
- typedef long long ll;
- using namespace std;
- int maxLen, maxCont;
- int main()
- {
- int t;
- cin >> t;
- int d = 0;
- while(t--)
- {
- d++;
- vector<ll> vec;
- vector<ll> res;
- ll sum = 0;
- for(int i = 0; i < 10; i++)
- {
- ll x;
- cin >> x;
- sum += x;
- vec.pb(x);
- }
- sort(vec.begin(), vec.end());
- sum /= 4;
- res.pb(sum - vec[9] - vec[0]);
- res.pb(vec[1] - res[0]);
- res.pb(vec[0] - res[1]);
- res.pb(vec[8] - res[0]);
- res.pb(vec[9] - res[3]);
- sort(res.begin(), res.end());
- cout << "Case " << d << ": ";
- for(int i = 0; i < 5; i++)
- {
- if(i < 4) cout << res[i] << " ";
- else
- cout << res[i];
- }
- cout << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement