Submission #1119827

#TimeUsernameProblemLanguageResultExecution timeMemory
1119827staszic_ojuzArt Exhibition (JOI18_art)C++17
100 / 100
154 ms8440 KiB
// Patryk Niemczyk art.cpp #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; vector<pair<long long, int>> v(n); for (int i = 0; i < n; ++i) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); long long odp = 0, suma = 0, minimum = 0; for (const auto &[wielkosc, wartosc] : v) { minimum = min(minimum, suma - wielkosc); suma += wartosc; odp = max(odp, suma - wielkosc - minimum); } cout << odp << '\n'; 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...