#include<bits/stdc++.h> usingnamespace std; #define ll long long constint INF = 0x3f3f3f3f; constint N = 2e5 + 10; int n, m; int a[N], b[N]; ll sum, ans; intmain(){ scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++)scanf("%d", &a[i]); for (int i = 1; i <= m; i++)scanf("%d", &b[i]), sum += b[i]; sort(a + 1, a + n + 1, greater<int>()); sort(b + 1, b + m + 1); if (b[1] < a[1]) { puts("-1"); return0; } ans += sum - b[1] + a[1]; if (b[1] != a[1])ans += 1ll * a[2] * (m - 1) + b[1]; else ans += 1ll * a[2] * m; for (int i = 3; i <= n; i++)ans += 1ll * m*a[i]; printf("%lld\n", ans); return0; }
#include<bits/stdc++.h> usingnamespace std; #define ll long long constint INF = 0x3f3f3f3f; constint N = 2e5 + 10; int n, k; intmain(){ scanf("%d%d", &n, &k); int a = (n - k) / 2; for (int i = 1; i <= n; i++)printf("%c", i % (a + 1) == 0 ? '1' : '0'); puts(""); return0; }