Submission #1014722

#TimeUsernameProblemLanguageResultExecution timeMemory
1014722whitewind664Unija (COCI17_unija)C++17
0 / 100
213 ms29776 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); ll n; cin >> n; vector<pair<ll, ll>> v(n + 1); for (int i = 0; i < n; i++) { cin >> v[i].first >> v[i].second; } v[n] = { 0, 100000000 }; sort(v.begin(), v.end()); ll rez = 0; for (int i = 1; i <= n; i++) { rez += (v[i].first - v[i - 1].first) * v[i].second; } cout << rez << endl; // int n; // cin >> n; // vector<pair<int,int>> pravoagolnik(n); // for (int i=0;i<n;i++) { // cin >> pravoagolnik[i].first >> pravoagolnik[i].second; // pravoagolnik[i].first/=2; // pravoagolnik[i].second/=2; // } // sort(pravoagolnik.begin(), pravoagolnik.end()); // int rez = pravoagolnik[0].first * pravoagolnik[0].second; // for (int i=1;i<n;i++) { // rez += (pravoagolnik[i].first-pravoagolnik[i-1].first) * pravoagolnik[i].second; // } // cout << 4 * rez << 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...