| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1182831 | william889 | Advertisement 2 (JOI23_ho_t2) | C++20 | 272 ms | 12220 KiB |
# include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n],b[n];
pair<long ,long>v[n];
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
v[i].first=a[i]-b[i];
v[i].second=-a[i]-b[i];
}
sort(v+1,v+n+1);
long long ans=0,cur=-1e9;
for(int i=1;i<=n;i++){
v[i].second=-v[i].second;
if(v[i].second>cur){
ans++;
cur=v[i].second;
}
}
cout<<ans;
}| # | 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... | ||||
