| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 12685 | 苏莉雯 | 活动选择 | C++ | Accepted | 100 | 1 MS | 260 KB | 344 | 2025-08-17 10:23:28 |
#include<bits/stdc++.h> using namespace std; struct fs { int b,e; } s[1000]; bool cmp1(fs a,fs c) { return a.e<c.e; } int main() { int n,g=1,d; cin>>n; for(int i=0; i<n; i++) { cin>>s[i].b>>s[i].e; } sort(s,s+n,cmp1); d=s[0].e; for(int i=1; i<n; i++) { if(d<=s[i].b) { g++; d=s[i].e; } } cout<<g; }