| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1197864 | Newtonabc | Advertisement 2 (JOI23_ho_t2) | C++20 | 271 ms | 4860 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>> v;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int a,b;
cin>>a >>b;
v.push_back({a-b,-(a+b)});
}
sort(v.begin(),v.end());
int ret=0,now=INT_MAX;
for(auto [a,b]:v) if(now>b) ret++,now=b;
cout<<ret;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
