#include <iostream> #include <algorithm> #include <vector> #include <iterator> using namespace std; int main() { int n {}; int k {}; int a {}; long long res {}; vector<int> b(500000, 0); cin >> n >> k; for (int i=0; i<n; i++) { cin >> a; if (b[a-1] == 0) { b[a-1] = 1; k--; } else { res += k; } if (k == 0) { cout << res << endl; return 0; } } cout << -1 << 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 | #include <iostream> #include <algorithm> #include <vector> #include <iterator> using namespace std; int main() { int n {}; int k {}; int a {}; long long res {}; vector<int> b(500000, 0); cin >> n >> k; for (int i=0; i<n; i++) { cin >> a; if (b[a-1] == 0) { b[a-1] = 1; k--; } else { res += k; } if (k == 0) { cout << res << endl; return 0; } } cout << -1 << endl; return 0; } |