Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> #include <queue> #include <algorithm> #include <fstream> using namespace std; typedef long long ll; int main() { int n; cin >> n; vector<pair<ll, ll>> v(n); for(int i = 0; i < n; i++) { cin >> v[i].second >> v[i].first; } sort(v.begin(), v.end()); int i = 0, j = n - 1; ll res = 0; int L = 0, R = 0; while(i <= j) { res = max(res, v[i].first + v[j].first); L++; R++; if(L > v[i].second) { i++; L = 0; } if(R > v[j].second) { j--; R = 0; } } cout << res << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
