#include <iostream> using namespace std; const int MAX_N = 512 * 1024; const int NO_ANSWER = -1; bool f[MAX_N]; int main() { ios_base::sync_with_stdio(0); int u = 0; int c = 0; long long m = 0; int n, k; cin >> n >> k; int b; for (int i = 0; i < n; ++i) { cin >> b; if (f[b]) { ++c; } else { f[b] = true; m += c; if (++u == k) { break; } } } cout << (u == k ? m : NO_ANSWER) << endl; return 0; }
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 26 27 28 29 30 31 32 33 34 35 36 37 | #include <iostream> using namespace std; const int MAX_N = 512 * 1024; const int NO_ANSWER = -1; bool f[MAX_N]; int main() { ios_base::sync_with_stdio(0); int u = 0; int c = 0; long long m = 0; int n, k; cin >> n >> k; int b; for (int i = 0; i < n; ++i) { cin >> b; if (f[b]) { ++c; } else { f[b] = true; m += c; if (++u == k) { break; } } } cout << (u == k ? m : NO_ANSWER) << endl; return 0; } |