Submission #1319835

#TimeUsernameProblemLanguageResultExecution timeMemory
1319835zyntherixLet's Win the Election (JOI22_ho_t3)C++20
5 / 100
1 ms332 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pi pair<int, int> #define vi vector<int> #define vs vector<string> #define vb vector<bool> #define vpi vector<pi> #define pb push_back #define all(a) (a).begin(), (a).end() const int mod = 1e9 + 7; void solve() { int n, k; cin >> n >> k; vi v(n); for (int i = 0; i < n; i++) { cin >> v[i]; int x; cin >> x; } sort(all(v)); double curr = 0; for (int i = 0; i < k; i++) curr += v[i]; cout << curr << '\n'; } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t = 1; // cin >> t; while (t--) { solve(); } return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...