#include <bits/stdc++.h> using namespace std; struct r{ string id; int f; }; bool cmp(r a,r b){ if(a.f != b.f)return a.f>b.f; else return a.id<b.id; } int main(){ int n,m; cin>>n>>m; r a[n]; int b[110]={0}; for(int i=0;i<n;i++){ cin>>a[i].id>>a[i].f; b[a[i].f]; } int fsx,rs=0; m=floor(m*1.5); for(int i=100;i>=1;i--){ if(m<1) break; for(int j=0;j<b[i];j){ rs++; m--; } fsx=i; } sort(a,a+n,cmp); cout<<fsx<<" "<<rs<<endl; for(int i=0;i<n;i++){ if(a[i].f>=fsx){ cout<<a[i].id<<" "<<a[i].f<<endl; } } return 0; }

#include<bits/stdc++.h> #define int long long using namespace std; const int maxn=1e7+10; int n,m,ans[maxn]; inline int read() { char c=getchar(); int x=0,s=1; while(c<'0' or c>'9') { if(c=='-') { s=-1; } c=getchar(); } while(c>='0' and c<='9') { x=x10+c-'0'; c=getchar(); } return xs; } void write(int x) { if(x<0) { putchar('-'),x=-x; } if(x>9) { write(x/10); } putchar(x%10+'0'); return; } struct node { int k,s; }arr[maxn]; bool cmp(node x,node y) { if(x.s>y.s) { return true; } else if(x.sy.s) { if(x.k<y.k) { return true; } else { return false; } } else { return false; } } signed main() { n=read(); m=read(); m=floor(m*1.5); for(int i=1;i<=n;i++) { arr[i].k=read(); arr[i].s=read(); } sort(arr+1,arr+n+1,cmp); int sum=arr[m].s; int p=m; for(int i=m+1;i<=n;i++) { if(arr[i].ssum) { p++; } else if(arr[i].s<sum) { break; } } cout<<sum<<" "<<p<<endl; for(int i=1;i<=p;i++) { cout<<arr[i].k<<" "<<arr[i].s<<endl; } return 0; }

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } } 有帮助，赞一个

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

#include <bits/stdc++.h> //导入万能工具箱 using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

#include <bits/stdc++.h> using namespace std; int s[105],k[10005][105]; int main(void) { int n,m,ss,kk,count = 0,i,max = 0,x,j; cin>>n>>m; m = m * 1.5; for (i = 0;i < n;i++) { scanf("%d%d",&kk,&ss); k[kk][ss]; s[ss]; } for (i = 100;count < m;i--) count += s[i]; cout<<i+1<<" "<<count<<endl; x = i + 1; for(i = 100;i >= x;i--) for(j = 1000;j <= 10000;j++) if(k[j][i])cout<<j<<" "<<i<<endl; return 0; }