제출 #1163420

#제출 시각아이디문제언어결과실행 시간메모리
1163420jmuzhenAkcija (COCI21_akcija)C++20
0 / 110
1 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define int long long int n, k; signed main() { cin >> n >> k; map<int, int> mp; for (int i = 0; i < n; i++) { int w, d; cin >> w >> d; if (!mp[d]) mp[d] = w; else mp[d] = min(mp[d], w); } vector<int> S; for (auto [_, w] : mp) S.push_back(w); sort(S.begin(), S.end()); // subtask 1 & 2 int sum = 0; for (int& x : S) sum += x; cout << S.size() << " " << sum << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...