목록알고리즘문제들/codeground (13)
VioletaBabel
#include#includeusing namespace std;int Answer, num[200000];int main(int argc, char** argv){setbuf(stdout, NULL);int T, test_case, n, k;scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){Answer = 0;scanf("%d %d", &n, &k);for (int i = 0; i < n; ++i)scanf("%d", &num[i]);sort(&num[0], &num[n]);for (int i = 1; i
#include#includeusing namespace std;int Answer;int main(int argc, char** argv){setbuf(stdout, NULL);int T, test_case, now, n;set num;scanf("%d", &T);for (test_case = 0; test_case < T; test_case++){Answer = -1;scanf("%d", &n);for (int i = 0; i < n; ++i){scanf("%d", &now);if (num.count(now))num.erase(num.find(now));elsenum.insert(now);}for (set::iterator iter = num.begin(); iter != num.end(); ++it..
#include#includeusing namespace std;int Answer, p[300000];int main(int argc, char** argv){int T, test_case, n, max = 0;setbuf(stdout, NULL);scanf("%d", &T);for (test_case = 0; test_case max) ? p[i] + (n - i) : max;for (int i = 0; i < n; ++i)Answer ..